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

org.apache.cassandra.cql3.statements.UpdatesCollector Maven / Gradle / Ivy

There is a newer version: 3.11.12.3
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.cassandra.cql3.statements;

import java.nio.ByteBuffer;
import java.util.*;

import org.apache.cassandra.config.CFMetaData;
import org.apache.cassandra.db.*;
import org.apache.cassandra.db.partitions.PartitionUpdate;

/**
 * Utility class to collect updates.
 *
 * 

In a batch statement we don't want to recreate mutations every time as this is particularly inefficient when * applying multiple batch to the same partition (see #6737).

* */ final class UpdatesCollector { /** * The columns that will be updated for each table (keyed by the table ID). */ private final Map updatedColumns; /** * The estimated number of updated row. */ private final int updatedRows; /** * The mutations per keyspace. */ private final Map> mutations = new HashMap<>(); public UpdatesCollector(Map updatedColumns, int updatedRows) { super(); this.updatedColumns = updatedColumns; this.updatedRows = updatedRows; } /** * Gets the PartitionUpdate for the specified column family and key. If the update does not * exist it will be created. * * @param cfm the column family meta data * @param dk the partition key * @param consistency the consistency level * @return the PartitionUpdate for the specified column family and key */ public PartitionUpdate getPartitionUpdate(CFMetaData cfm, DecoratedKey dk, ConsistencyLevel consistency) { Mutation mut = getMutation(cfm, dk, consistency); PartitionUpdate upd = mut.get(cfm); if (upd == null) { PartitionColumns columns = updatedColumns.get(cfm.cfId); assert columns != null; upd = new PartitionUpdate(cfm, dk, columns, updatedRows); mut.add(upd); } return upd; } /** * Check all partition updates contain only valid values for any * indexed columns. */ public void validateIndexedColumns() { for (Map perKsMutations : mutations.values()) for (IMutation mutation : perKsMutations.values()) for (PartitionUpdate update : mutation.getPartitionUpdates()) Keyspace.openAndGetStore(update.metadata()).indexManager.validate(update); } private Mutation getMutation(CFMetaData cfm, DecoratedKey dk, ConsistencyLevel consistency) { String ksName = cfm.ksName; IMutation mutation = keyspaceMap(ksName).get(dk.getKey()); if (mutation == null) { Mutation mut = new Mutation(ksName, dk); mutation = cfm.isCounter() ? new CounterMutation(mut, consistency) : mut; keyspaceMap(ksName).put(dk.getKey(), mutation); return mut; } return cfm.isCounter() ? ((CounterMutation) mutation).getMutation() : (Mutation) mutation; } /** * Returns a collection containing all the mutations. * @return a collection containing all the mutations. */ public Collection toMutations() { // The case where all statement where on the same keyspace is pretty common if (mutations.size() == 1) return mutations.values().iterator().next().values(); List ms = new ArrayList<>(); for (Map ksMap : mutations.values()) ms.addAll(ksMap.values()); return ms; } /** * Returns the key-mutation mappings for the specified keyspace. * * @param ksName the keyspace name * @return the key-mutation mappings for the specified keyspace. */ private Map keyspaceMap(String ksName) { Map ksMap = mutations.get(ksName); if (ksMap == null) { ksMap = new HashMap<>(); mutations.put(ksName, ksMap); } return ksMap; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy