com.google.javascript.jscomp.newtypes.ClojurePersistentHashSet Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of closure-compiler Show documentation
Show all versions of closure-compiler Show documentation
Closure Compiler is a JavaScript optimizing compiler. It parses your
JavaScript, analyzes it, removes dead code and rewrites and minimizes
what's left. It also checks syntax, variable references, and types, and
warns about common JavaScript pitfalls. It is used in many of Google's
JavaScript apps, including Gmail, Google Web Search, Google Maps, and
Google Docs.
/*
* Copyright 2014 The Closure Compiler Authors.
*
* 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.javascript.jscomp.newtypes;
import com.google.common.annotations.GwtIncompatible;
import java.lang.reflect.Method;
import java.util.Iterator;
import java.util.Set;
@GwtIncompatible("java.lang.reflect")
/** A persistent set that simply wraps Clojure's implementation */
final class ClojurePersistentHashSet extends PersistentSet {
private static Method cons;
private static Method disjoin;
private final Set set;
private ClojurePersistentHashSet(Set s) {
this.set = s;
}
public static PersistentSet create(Class cls) {
try {
cons = cls.getDeclaredMethod("cons", Object.class);
disjoin = cls.getDeclaredMethod("disjoin", Object.class);
Set m = (Set) cls.getDeclaredField("EMPTY").get(null);
return new ClojurePersistentHashSet<>(m);
} catch (ReflectiveOperationException e) {
throw new RuntimeException(e);
}
}
public PersistentSet with(K key) {
try {
Set s = (Set) cons.invoke(this.set, key);
return new ClojurePersistentHashSet<>(s);
} catch (ReflectiveOperationException e) {
throw new RuntimeException(e);
}
}
public PersistentSet without(K key) {
try {
Set s = (Set) disjoin.invoke(this.set, key);
return new ClojurePersistentHashSet<>(s);
} catch (ReflectiveOperationException e) {
throw new RuntimeException(e);
}
}
@Override
public boolean contains(Object key) {
return this.set.contains(key);
}
@Override
public int size() {
return this.set.size();
}
@Override
public boolean isEmpty() {
return this.set.isEmpty();
}
@Override
@SuppressWarnings("unchecked")
public Iterator iterator() {
return this.set.iterator();
}
@Override
public boolean equals(Object o) {
if (o instanceof ClojurePersistentHashSet) {
ClojurePersistentHashSet ps = (ClojurePersistentHashSet) o;
return this.set.equals(ps.set);
}
return false;
}
@Override
public int hashCode() {
return this.set.hashCode();
}
}