18#ifndef _DECAF_UTIL_LINKEDHASHSET_H_
19#define _DECAF_UTIL_LINKEDHASHSET_H_
90 template<
typename E,
typename HASHCODE = HashCode<E> >
135 (collection.
size() < 6 ? 11 : collection.
size() * 2))) {
138 while (iter->hasNext()) {
139 this->
add(iter->next());
147 return "LinkedHashSet";
virtual decaf::util::Iterator< E > * iterator()=0
Decaf's implementation of a Smart Pointer that is a template on a Type and is Thread Safe if the defa...
Definition Pointer.h:53
The root interface in the collection hierarchy.
Definition Collection.h:69
virtual int size() const
Returns the number of elements in this HashSet.
Definition HashSet.h:264
HashSet()
Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load ...
Definition HashSet.h:81
virtual bool add(const E &value)
Adds the specified element to this set if it is not already present.
Definition HashSet.h:186
Hashed and linked list implementation of the Map interface, with predictable iteration order.
Definition LinkedHashMap.h:111
LinkedHashSet()
Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load ...
Definition LinkedHashSet.h:98
LinkedHashSet(int capacity)
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and defa...
Definition LinkedHashSet.h:108
LinkedHashSet(const Collection< E > &collection)
Constructs a new set containing the elements in the specified collection.
Definition LinkedHashSet.h:133
LinkedHashSet(int capacity, float loadFactor)
Constructs a new instance of HashSet with the specified capacity and load factor.
Definition LinkedHashSet.h:120
virtual ~LinkedHashSet()
Definition LinkedHashSet.h:143
virtual std::string toString() const
Definition LinkedHashSet.h:146
A collection that contains no duplicate elements.
Definition Set.h:45
Definition AbstractCollection.h:33
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements.
Definition AprPool.h:25