Lines Matching full:nodes
61 * node=nodes[index].
88 * Skips over nodes of weaker strength to maintain collation order
105 * Skips weaker nodes and tailored nodes if the current node is stronger
153 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
155 * The nodes array can then be used only as a source of tailored CEs.
159 * Counts the tailored nodes of the given strength up to the next node
223 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
226 * Node bit 6 is set on a primary node if there are nodes
231 * Node bit 5 is set on a primary or secondary node if there are nodes
310 * Indexes of nodes with root primary weights, sorted by primary.
314 * Without this, we would have to search through the entire nodes list.
315 * It also allows storing root primary weights in list head nodes,
316 * without previous index, leaving room in root primary nodes for 32-bit primary weights.
321 * Doubly-linked lists of nodes in mostly collation order.
324 * When there are any nodes in the list, then there is always a root primary node at index 0.
327 * Root primary nodes have 32-bit weights but do not have previous indexes.
328 * All other nodes have at most 16-bit weights and do have previous indexes.
330 * Nodes with explicit weights store root collator weights,
331 * or default weak weights (e.g., secondary 05) for stronger nodes.
332 * "Tailored" nodes, with the IS_TAILORED bit set,
354 * If the flag is not set, then there are no explicit secondary nodes
357 * Same for HAS_BEFORE3 for tertiary nodes and weights.
362 * and temporary CEs stored in a CollationDataBuilder only point to tailored nodes.
368 * then the tailored nodes are replaced with final CEs,
371 * We cannot simply insert new nodes in the middle of the array
373 * We need to use a linked graph with stable indexes to existing nodes.
382 * Weaker root nodes & tailored nodes:
388 * All types of nodes:
401 UVector64 nodes;
