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

org.apache.cassandra.cql3.restrictions.RestrictionSet Maven / Gradle / Ivy

Go to download

The Apache Cassandra Project develops a highly scalable second-generation distributed database, bringing together Dynamo's fully distributed design and Bigtable's ColumnFamily-based data model.

There is a newer version: 5.0.2
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.restrictions;

import java.util.*;

import com.google.common.collect.AbstractIterator;

import org.apache.cassandra.schema.ColumnMetadata;
import org.apache.cassandra.cql3.QueryOptions;
import org.apache.cassandra.cql3.functions.Function;
import org.apache.cassandra.cql3.restrictions.SingleColumnRestriction.ContainsRestriction;
import org.apache.cassandra.db.filter.RowFilter;
import org.apache.cassandra.exceptions.InvalidRequestException;
import org.apache.cassandra.index.IndexRegistry;
import org.apache.commons.lang3.builder.ToStringBuilder;
import org.apache.commons.lang3.builder.ToStringStyle;

/**
 * Sets of column restrictions.
 *
 * 

This class is immutable.

*/ final class RestrictionSet implements Restrictions, Iterable { /** * The comparator used to sort the Restrictions. */ private static final Comparator COLUMN_DEFINITION_COMPARATOR = new Comparator() { @Override public int compare(ColumnMetadata column, ColumnMetadata otherColumn) { int value = Integer.compare(column.position(), otherColumn.position()); return value != 0 ? value : column.name.bytes.compareTo(otherColumn.name.bytes); } }; private static final TreeMap EMPTY = new TreeMap<>(COLUMN_DEFINITION_COMPARATOR); /** * The restrictions per column. */ protected final TreeMap restrictions; /** * {@code true} if it contains multi-column restrictions, {@code false} otherwise. */ private final boolean hasMultiColumnRestrictions; private final boolean hasIn; private final boolean hasContains; private final boolean hasSlice; private final boolean hasOnlyEqualityRestrictions; public RestrictionSet() { this(EMPTY, false, false, false, false, true); } private RestrictionSet(TreeMap restrictions, boolean hasMultiColumnRestrictions, boolean hasIn, boolean hasContains, boolean hasSlice, boolean hasOnlyEqualityRestrictions) { this.restrictions = restrictions; this.hasMultiColumnRestrictions = hasMultiColumnRestrictions; this.hasIn = hasIn; this.hasContains = hasContains; this.hasSlice = hasSlice; this.hasOnlyEqualityRestrictions = hasOnlyEqualityRestrictions; } @Override public void addRowFilterTo(RowFilter filter, IndexRegistry indexRegistry, QueryOptions options) throws InvalidRequestException { for (Restriction restriction : restrictions.values()) restriction.addRowFilterTo(filter, indexRegistry, options); } @Override public List getColumnDefs() { return new ArrayList<>(restrictions.keySet()); } @Override public void addFunctionsTo(List functions) { for (Restriction restriction : this) restriction.addFunctionsTo(functions); } @Override public boolean isEmpty() { return restrictions.isEmpty(); } @Override public int size() { return restrictions.size(); } /** * Checks if one of the restrictions applies to a column of the specific kind. * @param kind the column kind * @return {@code true} if one of the restrictions applies to a column of the specific kind, {@code false} otherwise. */ public boolean hasRestrictionFor(ColumnMetadata.Kind kind) { for (ColumnMetadata column : restrictions.keySet()) { if (column.kind == kind) return true; } return false; } /** * Adds the specified restriction to this set of restrictions. * * @param restriction the restriction to add * @return the new set of restrictions */ public RestrictionSet addRestriction(SingleRestriction restriction) { // RestrictionSet is immutable so we need to clone the restrictions map. TreeMap newRestricitons = new TreeMap<>(this.restrictions); boolean newHasIn = hasIn || restriction.isIN(); boolean newHasContains = hasContains || restriction.isContains(); boolean newHasSlice = hasSlice || restriction.isSlice(); boolean newHasOnlyEqualityRestrictions = hasOnlyEqualityRestrictions && (restriction.isEQ() || restriction.isIN()); return new RestrictionSet(mergeRestrictions(newRestricitons, restriction), hasMultiColumnRestrictions || restriction.isMultiColumn(), newHasIn, newHasContains, newHasSlice, newHasOnlyEqualityRestrictions); } private TreeMap mergeRestrictions(TreeMap restrictions, SingleRestriction restriction) { Collection columnDefs = restriction.getColumnDefs(); Set existingRestrictions = getRestrictions(columnDefs); if (existingRestrictions.isEmpty()) { for (ColumnMetadata columnDef : columnDefs) restrictions.put(columnDef, restriction); } else { for (SingleRestriction existing : existingRestrictions) { SingleRestriction newRestriction = mergeRestrictions(existing, restriction); for (ColumnMetadata columnDef : columnDefs) restrictions.put(columnDef, newRestriction); } } return restrictions; } @Override public Set getRestrictions(ColumnMetadata columnDef) { Restriction existing = restrictions.get(columnDef); return existing == null ? Collections.emptySet() : Collections.singleton(existing); } /** * Returns all the restrictions applied to the specified columns. * * @param columnDefs the column definitions * @return all the restrictions applied to the specified columns */ private Set getRestrictions(Collection columnDefs) { Set set = new HashSet<>(); for (ColumnMetadata columnDef : columnDefs) { SingleRestriction existing = restrictions.get(columnDef); if (existing != null) set.add(existing); } return set; } @Override public final boolean hasSupportingIndex(IndexRegistry indexRegistry) { for (Restriction restriction : restrictions.values()) { if (restriction.hasSupportingIndex(indexRegistry)) return true; } return false; } /** * Returns the column after the specified one. * * @param columnDef the column for which the next one need to be found * @return the column after the specified one. */ ColumnMetadata nextColumn(ColumnMetadata columnDef) { return restrictions.tailMap(columnDef, false).firstKey(); } @Override public ColumnMetadata getFirstColumn() { return isEmpty() ? null : this.restrictions.firstKey(); } @Override public ColumnMetadata getLastColumn() { return isEmpty() ? null : this.restrictions.lastKey(); } /** * Returns the last restriction. * * @return the last restriction. */ SingleRestriction lastRestriction() { return isEmpty() ? null : this.restrictions.lastEntry().getValue(); } /** * Merges the two specified restrictions. * * @param restriction the first restriction * @param otherRestriction the second restriction * @return the merged restriction * @throws InvalidRequestException if the two restrictions cannot be merged */ private static SingleRestriction mergeRestrictions(SingleRestriction restriction, SingleRestriction otherRestriction) { return restriction == null ? otherRestriction : restriction.mergeWith(otherRestriction); } /** * Checks if the restrictions contains multiple contains, contains key, or map[key] = value. * * @return true if the restrictions contains multiple contains, contains key, or , * map[key] = value; false otherwise */ public final boolean hasMultipleContains() { int numberOfContains = 0; for (SingleRestriction restriction : restrictions.values()) { if (restriction.isContains()) { ContainsRestriction contains = (ContainsRestriction) restriction; numberOfContains += (contains.numberOfValues() + contains.numberOfKeys() + contains.numberOfEntries()); } } return numberOfContains > 1; } @Override public Iterator iterator() { Iterator iterator = restrictions.values().iterator(); return hasMultiColumnRestrictions ? new DistinctIterator<>(iterator) : iterator; } /** * Checks if any of the underlying restriction is an IN. * @return true if any of the underlying restriction is an IN, false otherwise */ public final boolean hasIN() { return hasIn; } public boolean hasContains() { return hasContains; } public final boolean hasSlice() { return hasSlice; } /** * Checks if all of the underlying restrictions are EQ or IN restrictions. * * @return true if all of the underlying restrictions are EQ or IN restrictions, * false otherwise */ public final boolean hasOnlyEqualityRestrictions() { return hasOnlyEqualityRestrictions; } /** * {@code Iterator} decorator that removes duplicates in an ordered one. * * @param iterator the decorated iterator * @param the iterator element type. */ private static final class DistinctIterator extends AbstractIterator { /** * The decorated iterator. */ private final Iterator iterator; /** * The previous element. */ private E previous; public DistinctIterator(Iterator iterator) { this.iterator = iterator; } protected E computeNext() { while(iterator.hasNext()) { E next = iterator.next(); if (!next.equals(previous)) { previous = next; return next; } } return endOfData(); } } @Override public String toString() { return ToStringBuilder.reflectionToString(this, ToStringStyle.SHORT_PREFIX_STYLE); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy