craterdog.collections.Set Maven / Gradle / Ivy
/************************************************************************
* Copyright (c) Crater Dog Technologies(TM). All Rights Reserved. *
************************************************************************
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. *
* *
* This code is free software; you can redistribute it and/or modify it *
* under the terms of The MIT License (MIT), as published by the Open *
* Source Initiative. (See http://opensource.org/licenses/MIT) *
************************************************************************/
package craterdog.collections;
import com.fasterxml.jackson.annotation.JsonCreator;
import com.fasterxml.jackson.annotation.JsonValue;
import craterdog.collections.abstractions.*;
import java.util.Comparator;
import org.slf4j.ext.XLogger;
import org.slf4j.ext.XLoggerFactory;
/**
* This collection class implements an ordered collection that does not allow duplicate elements.
* The implementation dynamically scales up and down the size of the underlying data structures as
* the number elements changes over time.
*
* @author Derk Norton
* @param The type of element managed by the collection.
*/
public class Set extends OrderedCollection {
static private final XLogger logger = XLoggerFactory.getXLogger(Set.class);
/**
* This constructor creates a new empty set with no comparator function.
*/
public Set() {
super(false);
}
/**
* This constructor creates a new set with no comparator function and seeds
* it with the elements from the specified array.
*
* @param elements The elements to be used to seed the new set.
*/
@JsonCreator
public Set(E[] elements) {
this(elements, null);
}
@JsonValue
@Override
public E[] toArray() {
return super.toArray();
}
/**
* This constructor creates a new set with no comparator function and seeds
* it with the elements from the specified collection.
*
* @param elements The elements to be used to seed the new set.
*/
public Set(Iterable elements) {
this(elements, null);
}
/**
* This constructor creates a new set with the specified comparator function.
*
* @param comparator The comparator to be used to compare two elements during ordering.
*/
public Set(Comparator comparator) {
super(false, comparator);
}
/**
* This constructor creates a new set with the specified comparator function and seeds
* it with the elements from the specified array.
*
* @param elements The elements to be used to seed the new set.
* @param comparator The comparator to be used to compare two elements during ordering.
*/
public Set(E[] elements, Comparator comparator) {
super(elements, false, comparator);
}
/**
* This constructor creates a new set with the specified comparator function and seeds
* it with the elements from the specified collection.
*
* @param elements The elements to be used to seed the new set.
* @param comparator The comparator to be used to compare two elements during ordering.
*/
public Set(Iterable elements, Comparator comparator) {
super(elements, false, comparator);
}
@Override
protected > T emptyCopy() {
@SuppressWarnings("unchecked")
T copy = (T) new Set<>();
return copy;
}
/**
* This function returns a new set that contains the elements that are in
* both the first set and the second set.
*
* @param The type of element contained in the sets.
* @param set1 The first set to be operated on.
* @param set2 The second set to be operated on.
* @return The resulting set.
*/
static public Set and(Set set1, Set set2) {
logger.entry(set1, set2);
Set result = new Set<>();
for (E element : set1) {
if (set2.containsElement(element)) {
logger.debug("The following element is in both sets: {}", element);
result.addElement(element);
}
}
logger.exit(result);
return result;
}
/**
* This function returns a new set that contains the elements that are in
* the first set but not in the second set.
*
* @param The type of element contained in the sets.
* @param set1 The first set to be operated on.
* @param set2 The second set to be operated on.
* @return The resulting set.
*/
static public Set sans(Set set1, Set set2) {
logger.entry(set1, set2);
Set result = new Set<>(set1);
result.removeElements(set2);
logger.exit(result);
return result;
}
/**
* This function returns a new set that contains all the elements that are in
* the first set or the second set or both.
*
* @param The type of element contained in the sets.
* @param set1 The first set to be operated on.
* @param set2 The second set to be operated on.
* @return The resulting set.
*/
static public Set or(Set set1, Set set2) {
logger.entry(set1, set2);
Set result = new Set<>(set1);
result.addElements(set2);
logger.exit(result);
return result;
}
/**
* This function returns a new set that contains all the elements that are in
* the first set or the second set but not both.
*
* @param The type of element contained in the sets.
* @param set1 The first set to be operated on.
* @param set2 The second set to be operated on.
* @return The resulting set.
*/
static public Set xor(Set set1, Set set2) {
logger.entry(set1, set2);
Set result = new Set<>();
for (E element : set1) {
if (!set2.containsElement(element)) {
logger.debug("Adding the following element from set 1 to the results: {}", element);
result.addElement(element);
}
}
for (E element : set2) {
if (!set1.containsElement(element)) {
logger.debug("Adding the following element from set 2 to the results: {}", element);
result.addElement(element);
}
}
logger.exit(result);
return result;
}
}