/** * @return <code>true</code> if there's a node of the specified color in this * tree following the current node. */ public boolean hasNextNode(/*[ COLORED_START ]*/ byte colors /*[ COLORED_END ]*/) { if(node == null) { return tree.size(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/) > 0; } else { return nodeEndIndex(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/) < tree.size(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/); } }
/** * @return <code>true</code> if there's a node of the specified color in this * tree following the current node. */ public boolean hasNextNode(/*[ COLORED_START ]*/ byte colors /*[ COLORED_END ]*/) { if(node == null) { return tree.size(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/) > 0; } else { return nodeEndIndex(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/) < tree.size(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/); } }
/** * @return <code>true</code> if there's a node of the specified color in this * tree following the current node. */ public boolean hasNextNode(/*[ COLORED_START ]*/ byte colors /*[ COLORED_END ]*/) { if(node == null) { return tree.size(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/) > 0; } else { return nodeEndIndex(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/) < tree.size(/*[ COLORED_START ]*/ colors /*[ COLORED_END ]*/); } }