Lines Matching refs:BLACK
35 * A Red-Black tree based {@link NavigableMap} implementation.
2091 // Red-black mechanics
2094 private static final boolean BLACK = true;
2115 boolean color = BLACK;
2119 * {@code null} child links, and BLACK color.
2256 return (p == null ? BLACK : p.color);
2320 setColor(parentOf(x), BLACK);
2321 setColor(y, BLACK);
2329 setColor(parentOf(x), BLACK);
2336 setColor(parentOf(x), BLACK);
2337 setColor(y, BLACK);
2345 setColor(parentOf(x), BLACK);
2351 root.color = BLACK;
2387 if (p.color == BLACK)
2392 if (p.color == BLACK)
2407 while (x != root && colorOf(x) == BLACK) {
2412 setColor(sib, BLACK);
2418 if (colorOf(leftOf(sib)) == BLACK &&
2419 colorOf(rightOf(sib)) == BLACK) {
2423 if (colorOf(rightOf(sib)) == BLACK) {
2424 setColor(leftOf(sib), BLACK);
2430 setColor(parentOf(x), BLACK);
2431 setColor(rightOf(sib), BLACK);
2439 setColor(sib, BLACK);
2445 if (colorOf(rightOf(sib)) == BLACK &&
2446 colorOf(leftOf(sib)) == BLACK) {
2450 if (colorOf(leftOf(sib)) == BLACK) {
2451 setColor(rightOf(sib), BLACK);
2457 setColor(parentOf(x), BLACK);
2458 setColor(leftOf(sib), BLACK);
2465 setColor(x, BLACK);
2649 * Find the level down to which to assign all nodes BLACK. This is the
