1 files changed, 0 insertions, 100 deletions
diff --git a/include/EASTL/intrusive_hash_set.h b/include/EASTL/intrusive_hash_set.h
deleted file mode 100644
index a25d03a..0000000
--- a/include/EASTL/intrusive_hash_set.h
+++ /dev/null
@@ -1,100 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-// Copyright (c) Electronic Arts Inc. All rights reserved.
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef EASTL_INTRUSIVE_HASH_SET_H
-#define EASTL_INTRUSIVE_HASH_SET_H
-
-
-#include <EASTL/internal/config.h>
-#include <EASTL/internal/intrusive_hashtable.h>
-#include <EASTL/functional.h>
-#include <EASTL/utility.h>
-
-#if defined(EA_PRAGMA_ONCE_SUPPORTED)
-	#pragma once // Some compilers (e.g. VC++) benefit significantly from using this. We've measured 3-4% build speed improvements in apps as a result.
-#endif
-
-
-
-namespace eastl
-{
-
-	/// intrusive_hash_set
-	///
-	/// Template parameters:
-	///     T               The type of object the set holds (a.k.a. value).
-	///     bucketCount     The number of buckets to use. Best if it's a prime number.
-	///     Hash            Hash function. See functional.h for examples of hash functions.
-	///     Equal           Equality testing predicate; tells if two elements are equal.
-	///
-	template <typename T, size_t bucketCount, typename Hash = eastl::hash<T>, typename Equal = eastl::equal_to<T> >
-	class intrusive_hash_set : public intrusive_hashtable<T, T, Hash, Equal, bucketCount, true, true>
-	{
-	public:
-		typedef intrusive_hashtable<T, T, Hash, Equal, bucketCount, true, true>     base_type;
-		typedef intrusive_hash_set<T, bucketCount, Hash, Equal>                     this_type;
-
-	public:
-		explicit intrusive_hash_set(const Hash& h = Hash(), const Equal& eq = Equal())
-			: base_type(h, eq)
-		{
-			// Empty
-		}
-
-		// To consider: Is this feasible, given how initializer_list works by creating a temporary array? Even if it is feasible, is it a good idea?
-		//intrusive_hash_set(std::initializer_list<value_type> ilist);
-
-	}; // intrusive_hash_set
-
-
-
-
-	/// intrusive_hash_multiset
-	///
-	/// Implements a intrusive_hash_multiset, which is the same thing as a intrusive_hash_set 
-	/// except that contained elements need not be unique. See the documentation 
-	/// for intrusive_hash_set for details.
-	///
-	/// Template parameters:
-	///     T               The type of object the set holds (a.k.a. value).
-	///     bucketCount     The number of buckets to use. Best if it's a prime number.
-	///     Hash            Hash function. See functional.h for examples of hash functions.
-	///     Equal           Equality testing predicate; tells if two elements are equal.
-	///
-	template <typename T, size_t bucketCount, typename Hash = eastl::hash<T>, typename Equal = eastl::equal_to<T> >
-	class intrusive_hash_multiset : public intrusive_hashtable<T, T, Hash, Equal, bucketCount, true, false>
-	{
-	public:
-		typedef intrusive_hashtable<T, T, Hash, Equal, bucketCount, true, false>    base_type;
-		typedef intrusive_hash_multiset<T, bucketCount, Hash, Equal>                this_type;
-
-	public:
-		explicit intrusive_hash_multiset(const Hash& h = Hash(), const Equal& eq = Equal())
-			: base_type(h, eq)
-		{
-			// Empty
-		}
-
-		// To consider: Is this feasible, given how initializer_list works by creating a temporary array? Even if it is feasible, is it a good idea?
-		//intrusive_hash_multiset(std::initializer_list<value_type> ilist);
-
-	}; // intrusive_hash_multiset
-
-
-} // namespace eastl
-
-
-#endif // Header include guard
-
-
-
-
-
-
-
-
-
-
-
-