• Home
• com.yelp.nrtsearch
• clientlib
• 1.0.0-alpha.1
• source code
• RewriteMethod.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.yelp.nrtsearch.server.grpc.RewriteMethod Maven / Gradle / Ivy

// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: yelp/nrtsearch/search.proto

// Protobuf Java Version: 3.25.3
package com.yelp.nrtsearch.server.grpc;

/**
 * 
 * Method used to rewrite a MultiTermQuery
 * 
 *
 * Protobuf enum {@code luceneserver.RewriteMethod}
 */
public enum RewriteMethod
    implements com.google.protobuf.ProtocolMessageEnum {
  /**
   * 
   * Uses the CONSTANT_SCORE_BOOLEAN method for fewer matching terms. Otherwise, this method finds all matching terms in sequence and returns matching documents using a bit set.
   * 
   *
   * CONSTANT_SCORE = 0;
   */
  CONSTANT_SCORE(0),
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term.
   * 
   *
   * CONSTANT_SCORE_BOOLEAN = 1;
   */
  CONSTANT_SCORE_BOOLEAN(1),
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Calculates the relevance score for each matching document.
   * 
   *
   * SCORING_BOOLEAN = 2;
   */
  SCORING_BOOLEAN(2),
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Calculates a relevance score for each matching document as if all terms had the same frequency, the maximum frequency of all matching terms. The final BooleanQuery query only includes Term queries for the top N (specified separately) scoring terms.
   * 
   *
   * TOP_TERMS_BLENDED_FREQS = 3;
   */
  TOP_TERMS_BLENDED_FREQS(3),
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Assigns each matching document a relevance score equal to the boost parameter. The final BooleanQuery query only includes Term queries for the top N (specified separately) terms.
   * 
   *
   * TOP_TERMS_BOOST = 4;
   */
  TOP_TERMS_BOOST(4),
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Calculates a relevance score for each matching document. The final BooleanQuery query only includes Term queries for the top N (specified separately) scoring terms.
   * 
   *
   * TOP_TERMS = 5;
   */
  TOP_TERMS(5),
  UNRECOGNIZED(-1),
  ;

  /**
   * 
   * Uses the CONSTANT_SCORE_BOOLEAN method for fewer matching terms. Otherwise, this method finds all matching terms in sequence and returns matching documents using a bit set.
   * 
   *
   * CONSTANT_SCORE = 0;
   */
  public static final int CONSTANT_SCORE_VALUE = 0;
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term.
   * 
   *
   * CONSTANT_SCORE_BOOLEAN = 1;
   */
  public static final int CONSTANT_SCORE_BOOLEAN_VALUE = 1;
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Calculates the relevance score for each matching document.
   * 
   *
   * SCORING_BOOLEAN = 2;
   */
  public static final int SCORING_BOOLEAN_VALUE = 2;
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Calculates a relevance score for each matching document as if all terms had the same frequency, the maximum frequency of all matching terms. The final BooleanQuery query only includes Term queries for the top N (specified separately) scoring terms.
   * 
   *
   * TOP_TERMS_BLENDED_FREQS = 3;
   */
  public static final int TOP_TERMS_BLENDED_FREQS_VALUE = 3;
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Assigns each matching document a relevance score equal to the boost parameter. The final BooleanQuery query only includes Term queries for the top N (specified separately) terms.
   * 
   *
   * TOP_TERMS_BOOST = 4;
   */
  public static final int TOP_TERMS_BOOST_VALUE = 4;
  /**
   * 
   * This method changes the original query to a BooleanQuery, containing a SHOULD clause and TermQuery for each matching term. Calculates a relevance score for each matching document. The final BooleanQuery query only includes Term queries for the top N (specified separately) scoring terms.
   * 
   *
   * TOP_TERMS = 5;
   */
  public static final int TOP_TERMS_VALUE = 5;


  public final int getNumber() {
    if (this == UNRECOGNIZED) {
      throw new java.lang.IllegalArgumentException(
          "Can't get the number of an unknown enum value.");
    }
    return value;
  }

  /**
   * @param value The numeric wire value of the corresponding enum entry.
   * @return The enum associated with the given numeric wire value.
   * @deprecated Use {@link #forNumber(int)} instead.
   */
  @java.lang.Deprecated
  public static RewriteMethod valueOf(int value) {
    return forNumber(value);
  }

  /**
   * @param value The numeric wire value of the corresponding enum entry.
   * @return The enum associated with the given numeric wire value.
   */
  public static RewriteMethod forNumber(int value) {
    switch (value) {
      case 0: return CONSTANT_SCORE;
      case 1: return CONSTANT_SCORE_BOOLEAN;
      case 2: return SCORING_BOOLEAN;
      case 3: return TOP_TERMS_BLENDED_FREQS;
      case 4: return TOP_TERMS_BOOST;
      case 5: return TOP_TERMS;
      default: return null;
    }
  }

  public static com.google.protobuf.Internal.EnumLiteMap
      internalGetValueMap() {
    return internalValueMap;
  }
  private static final com.google.protobuf.Internal.EnumLiteMap<
      RewriteMethod> internalValueMap =
        new com.google.protobuf.Internal.EnumLiteMap() {
          public RewriteMethod findValueByNumber(int number) {
            return RewriteMethod.forNumber(number);
          }
        };

  public final com.google.protobuf.Descriptors.EnumValueDescriptor
      getValueDescriptor() {
    if (this == UNRECOGNIZED) {
      throw new java.lang.IllegalStateException(
          "Can't get the descriptor of an unrecognized enum value.");
    }
    return getDescriptor().getValues().get(ordinal());
  }
  public final com.google.protobuf.Descriptors.EnumDescriptor
      getDescriptorForType() {
    return getDescriptor();
  }
  public static final com.google.protobuf.Descriptors.EnumDescriptor
      getDescriptor() {
    return com.yelp.nrtsearch.server.grpc.SearchResponseProto.getDescriptor().getEnumTypes().get(1);
  }

  private static final RewriteMethod[] VALUES = values();

  public static RewriteMethod valueOf(
      com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
    if (desc.getType() != getDescriptor()) {
      throw new java.lang.IllegalArgumentException(
        "EnumValueDescriptor is not for this type.");
    }
    if (desc.getIndex() == -1) {
      return UNRECOGNIZED;
    }
    return VALUES[desc.getIndex()];
  }

  private final int value;

  private RewriteMethod(int value) {
    this.value = value;
  }

  // @@protoc_insertion_point(enum_scope:luceneserver.RewriteMethod)
}