com.google.cloud.firestore.collection.LLRBNode Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of google-cloud-firestore Show documentation

Java idiomatic client for Google Cloud Firestore.

There is a newer version: 3.29.1

Show newest version

/*
 * Copyright 2017 Google LLC
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *       http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.cloud.firestore.collection;

import com.google.api.core.InternalApi;
import java.util.Comparator;

// Note: This package is copied from https://github.com/firebase/firebase-admin-java/tree/master/
// src/main/java/com/google/firebase/database/collection
@InternalApi
public interface LLRBNode {

  interface ShortCircuitingNodeVisitor {
    boolean shouldContinue(K key, V value);
  }

  abstract class NodeVisitor implements ShortCircuitingNodeVisitor {

    @Override
    public boolean shouldContinue(K key, V value) {
      visitEntry(key, value);
      return true;
    }

    public abstract void visitEntry(K key, V value);
  }

  enum Color {
    RED,
    BLACK
  }

  LLRBNode copy(K key, V value, Color color, LLRBNode left, LLRBNode right);

  LLRBNode insert(K key, V value, Comparator comparator);

  LLRBNode remove(K key, Comparator comparator);

  boolean isEmpty();

  boolean isRed();

  K getKey();

  V getValue();

  LLRBNode getLeft();

  LLRBNode getRight();

  LLRBNode getMin();

  LLRBNode getMax();

  int size();

  void inOrderTraversal(NodeVisitor visitor);

  boolean shortCircuitingInOrderTraversal(ShortCircuitingNodeVisitor visitor);

  boolean shortCircuitingReverseOrderTraversal(ShortCircuitingNodeVisitor visitor);
}