// Copyright 2014 The Bazel Authors. All rights reserved. // // Licensed 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 com.google.devtools.build.lib.collect.nestedset; import java.util.Arrays; import java.util.Objects; import javax.annotation.Nullable; /** * Memory-efficient implementation for the case where we have many direct elements and one * transitive NestedSet. */ abstract class ManyDirectOneTransitiveNestedSet extends MemoizedUniquefierNestedSet { private final Object[] directs; private final NestedSet transitive; private Object memo; public ManyDirectOneTransitiveNestedSet(Object[] directs, NestedSet transitive) { this.directs = directs; this.transitive = transitive; } @Override Object getMemo() { return memo; } @Override void setMemo(Object memo) { this.memo = memo; } @Override Object[] directMembers() { return directs; } @Override NestedSet[] transitiveSets() { return new NestedSet[]{transitive}; } @Override public boolean shallowEquals(@Nullable NestedSet other) { if (this == other) { return true; } return other != null && getOrder().equals(other.getOrder()) && other instanceof ManyDirectOneTransitiveNestedSet && Arrays.equals(directs, ((ManyDirectOneTransitiveNestedSet) other).directs) && transitive == ((ManyDirectOneTransitiveNestedSet) other).transitive; } @Override public int shallowHashCode() { return Objects.hash(getOrder(), Arrays.hashCode(directs), transitive); } }