◆ firstIndex
| int16_t fiftyoneDegreesGraphNode::firstIndex |
First character index to search for a matching hash code.
\r\n
51Degrees Device Detection C/C++
4.4
Graph node structure used to construct the directed acyclic graph to search.
| int32_t | unmatchedNodeOffset
Offset of the node to use if there is no matching hash record. More...
|
| byte | flags
Flags available for future implementation. More...
|
| int16_t | firstIndex
First character index to search for a matching hash code. More...
|
| int16_t | lastIndex
Last character index to search for a matching hash code. More...
|
| byte | length
Length of the substring to hash. More...
|
| int32_t | hashesCount
Number of hash records in the node. More...
|
| int32_t | modulo
Modulo to use when the hashes are a hash table. More...
|
| int16_t fiftyoneDegreesGraphNode::firstIndex |
First character index to search for a matching hash code.
| byte fiftyoneDegreesGraphNode::flags |
Flags available for future implementation.
| int32_t fiftyoneDegreesGraphNode::hashesCount |
Number of hash records in the node.
| int16_t fiftyoneDegreesGraphNode::lastIndex |
Last character index to search for a matching hash code.
| byte fiftyoneDegreesGraphNode::length |
Length of the substring to hash.
| int32_t fiftyoneDegreesGraphNode::modulo |
Modulo to use when the hashes are a hash table.
| int32_t fiftyoneDegreesGraphNode::unmatchedNodeOffset |
Offset of the node to use if there is no matching hash record.