Return the position where the edge 'c' should be inserted in order to * preserve lexicographic ordering. */
| 292 | /* Return the position where the edge 'c' should be inserted in order to |
| 293 | * preserve lexicographic ordering. */ |
| 294 | static inline int raxNodeFindChildPos(raxNode *n, unsigned char c) { |
| 295 | int pos; |
| 296 | |
| 297 | assert(n->iscompr == 0); |
| 298 | for (pos = 0; pos < n->size; pos++) { |
| 299 | if (n->data[pos] > c) break; |
| 300 | } |
| 301 | return pos; |
| 302 | } |
| 303 | |
| 304 | /* Like raxAddChild() but does not allocate the child node. Instead it |
| 305 | * returns in 'parentlink' the address of the new child pointer, so that the |
no outgoing calls
no test coverage detected