All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.lucene.codecs.MutablePointTree Maven / Gradle / Ivy

There is a newer version: 6.4.2_1
Show newest version
/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You 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 org.apache.lucene.codecs;

import org.apache.lucene.index.PointValues.IntersectVisitor;
import org.apache.lucene.index.PointValues.PointTree;
import org.apache.lucene.util.BytesRef;

/**
 * One leaf {@link PointTree} whose order of points can be changed. This class is useful for codecs
 * to optimize flush.
 *
 * @lucene.internal
 */
public abstract class MutablePointTree implements PointTree {

  /** Sole constructor. */
  protected MutablePointTree() {}

  /** Set {@code packedValue} with a reference to the packed bytes of the i-th value. */
  public abstract void getValue(int i, BytesRef packedValue);

  /** Get the k-th byte of the i-th value. */
  public abstract byte getByteAt(int i, int k);

  /** Return the doc ID of the i-th value. */
  public abstract int getDocID(int i);

  /** Swap the i-th and j-th values. */
  public abstract void swap(int i, int j);

  /** Save the i-th value into the j-th position in temporary storage. */
  public abstract void save(int i, int j);

  /** Restore values between i-th and j-th(excluding) in temporary storage into original storage. */
  public abstract void restore(int i, int j);

  @Override
  public final PointTree clone() {
    throw new UnsupportedOperationException();
  }

  @Override
  public final boolean moveToChild() {
    return false;
  }

  @Override
  public final boolean moveToSibling() {
    return false;
  }

  @Override
  public final boolean moveToParent() {
    return false;
  }

  @Override
  public byte[] getMinPackedValue() {
    throw new UnsupportedOperationException();
  }

  @Override
  public byte[] getMaxPackedValue() {
    throw new UnsupportedOperationException();
  }

  @Override
  public void visitDocIDs(IntersectVisitor visitor) {
    throw new UnsupportedOperationException();
  }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy