Chuntao Hong

Looking at the log, the crash at 9/14 occurred during handling of a Cypher request. Was the crash at 9/9 also caused by a Cypher request? If that is the...

Currently TuGraph does no keep track of the number of vertexes or edges. Instead, it scans the whole graph and counts the vertexes/edges when asked to, which takes a long...

c-binding理论上可行，就是接口看起来会比较恶心 braft的C++接口主要就是StateMachine那堆虚函数，加上Node里面一些功能。基本思路就是，每个虚函数对应一个函数指针，Node里的每个成员函数变成一个函数调用，大概长这个样子： ```C++ //================== // c wrapper typedef void(BraftIterator*) OnApplyFunction; class BraftStateMachineForC : public StateMachine { public: void set_on_apply(OnApplyFunction on_apply_function) { on_apply_func_ = on_apply_function; } void Start() { ... }...

1 is solved in 170bc4463c8da1a887b9e120e4f3a925622da322

文档：https://github.com/TuGraph-family/tugraph-db/tree/master/doc 生效范围：TuGraph-family/tugraph-db 转发：