Lines Matching defs:index
64 * node=nodes[index].
66 uint32_t getWeight16Before(int32_t index, int64_t node, int32_t level);
86 int32_t findOrInsertWeakNode(int32_t index, uint32_t weight16, int32_t level,
90 * Makes and inserts a new tailored node into the list, after the one at index.
93 * @return the new node's index
95 int32_t insertTailoredNodeAfter(int32_t index, int32_t strength, UErrorCode &errorCode);
100 * @return the new node's index
102 int32_t insertNodeBetween(int32_t index, int32_t nextIndex, int64_t node,
110 * Always returns the input index if that node is no stronger than the given strength.
112 int32_t findCommonNode(int32_t index, int32_t strength) const;
175 * The index must not exceed 20 bits (0xfffff).
183 static inline int64_t tempCEFromIndexAndStrength(int32_t index, int32_t strength) {
187 // index bits 19..13 -> primary byte 1 = CE bits 63..56 (byte values 40..BF)
188 ((int64_t)(index & 0xfe000) << 43) +
189 // index bits 12..6 -> primary byte 2 = CE bits 55..48 (byte values 40..BF)
190 ((int64_t)(index & 0x1fc0) << 42) +
191 // index bits 5..0 -> secondary byte 1 = CE bits 31..24 (byte values 06..45)
192 ((index & 0x3f) << 24) +
315 * Compact form of a TreeMap from root primary to node index.
320 * without previous index, leaving room in root primary nodes for 32-bit primary weights.
328 * When there are any nodes in the list, then there is always a root primary node at index 0.
390 * - index to the previous node: 20 bits 47..28
393 * - index to the next node: 20 bits 27..8