Lines Matching defs:nodes
63 * node=nodes[index].
90 * Skips over nodes of weaker strength to maintain collation order
107 * Skips weaker nodes and tailored nodes if the current node is stronger
155 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
157 * The nodes array can then be used only as a source of tailored CEs.
161 * Counts the tailored nodes of the given strength up to the next node
225 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
228 * Node bit 6 is set on a primary node if there are nodes
233 * Node bit 5 is set on a primary or secondary node if there are nodes
312 * Indexes of nodes with root primary weights, sorted by primary.
316 * Without this, we would have to search through the entire nodes list.
317 * It also allows storing root primary weights in list head nodes,
318 * without previous index, leaving room in root primary nodes for 32-bit primary weights.
323 * Doubly-linked lists of nodes in mostly collation order.
326 * When there are any nodes in the list, then there is always a root primary node at index 0.
329 * Root primary nodes have 32-bit weights but do not have previous indexes.
330 * All other nodes have at most 16-bit weights and do have previous indexes.
332 * Nodes with explicit weights store root collator weights,
333 * or default weak weights (e.g., secondary 05) for stronger nodes.
334 * "Tailored" nodes, with the IS_TAILORED bit set,
356 * If the flag is not set, then there are no explicit secondary nodes
359 * Same for HAS_BEFORE3 for tertiary nodes and weights.
364 * and temporary CEs stored in a CollationDataBuilder only point to tailored nodes.
370 * then the tailored nodes are replaced with final CEs,
373 * We cannot simply insert new nodes in the middle of the array
375 * We need to use a linked graph with stable indexes to existing nodes.
384 * Weaker root nodes & tailored nodes:
390 * All types of nodes:
403 UVector64 nodes;
