Detailed Description
Graph node structure used to construct the directed acyclic graph to search.
Data Fields | |
| int32_t | unmatchedNodeOffset |
| Offset of the node to use if there is no matching hash record. | |
| byte | flags |
| Flags available for future implementation. | |
| int16_t | firstIndex |
| First character index to search for a matching hash code. | |
| int16_t | lastIndex |
| Last character index to search for a matching hash code. | |
| byte | length |
| Length of the substring to hash. | |
| int32_t | hashesCount |
| Number of hash records in the node. | |
| int32_t | modulo |
| Modulo to use when the hashes are a hash table. | |
Field Documentation
◆ modulo
| int32_t fiftyoneDegreesGraphNode::modulo |
Modulo to use when the hashes are a hash table.
Zero when the hash records are instead an ordered list to be searched. When positive, the first modulo records are the slots indexed by (hash % modulo) and the records from index modulo onwards hold the collision buckets, so a valid value never exceeds hashesCount.
The documentation for this struct was generated from the following file: