/*
 * 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.
 */

option java_package = "org.apache.phoenix.coprocessor.generated";
option java_outer_classname = "IndexMutationsProtos";
option java_generic_services = true;
option java_generate_equals_and_hash = true;
option optimize_for = SPEED;

// The batch of index mutations for eventually consistent indexes.
// Each entry pairs a target index table name (tables[i]) with its
// corresponding serialized HBase MutationProto (mutations[i]).
message IndexMutations {
  repeated bytes tables = 1;
  repeated bytes mutations = 2;
}

// Raw data row states for generating index mutations.
// Contains the data row key and serialized MutationProto for the before and after states.
message DataRowStates {
  optional bytes dataRowKey = 1;
  optional bytes currentDataRowState = 2;
  optional bytes nextDataRowState = 3;
}
