IHash
Definition
Ihashi Elimhlophe
Ihash (Senior Member) Registration Date: Date of Birth: Not Specified Local Time: at 01:22 AM Status: Offline. Begin Method (ContainerBidirectionalIterator).NET Framework (current version) Other Versions Visual Studio 2010.NET Framework 4; Visual Studio 2008.NET Framework 3.5 Note; The.NET API Reference documentation has a new home. IHASH Technologies 66 followers on LinkedIn. Hash Technology is a business data process service and IT company. It will evolve and change over time to meet the need of evolving markets.It.
Defines the interface of the STL/CLR hash_map
, hash_multimap
, hash_set
, and hash_multiset
objects. Can i download windows 10 minecraft on mac.
Type Parameters
- TKey
The type of the key component of an element in the controlled sequence.
- TValue
The type of the value component of an element in the controlled sequence.
Remarks
Some methods, especially operators, declare a type for a parameter but do not specify a parameter name. Such a parameter is known as an unnamed parameter. In the documentation for these methods, the __unnamed0 placeholder represents the unnamed parameter.
Adobe photoshop cc mac download free. full version. For more information, see hash_map (STL/CLR), hash_multimap (STL/CLR), hash_set (STL/CLR), and hash_multiset (STL/CLR).
Properties
Count | Gets the number of elements contained in the ICollection. (Inherited from ICollection) |
IsSynchronized | Gets a value indicating whether access to the ICollection is synchronized (thread safe). (Inherited from ICollection) |
SyncRoot | Gets an object that can be used to synchronize access to the ICollection. (Inherited from ICollection) |
Methods
begin(ContainerBidirectionalIterator<TValue>) | Designates the beginning of the controlled sequence. |
bucket_count() | Counts the number of buckets in the hash table. |
clear() | Removes all elements from the container. |
Clone() | Creates a new object that is a copy of the current instance. (Inherited from ICloneable) |
CopyTo(Array, Int32) | Copies the elements of the ICollection to an Array, starting at a particular Array index. (Inherited from ICollection) |
count(TKey) | Finds the number of elements that match a specified key. |
empty() | Tests whether no elements are present in the container. |
end(ContainerBidirectionalIterator<TValue>) | Designates the end of the controlled sequence. |
equal_range(GenericPair<ContainerBidirectionalIterator<TValue>,ContainerBidirectionalIterator<TValue>>, TKey) | Finds the range that matches a specified key. |
erase(ContainerBidirectionalIterator<TValue>, ContainerBidirectionalIterator<TValue>) | Removes from the container the element that is specified by the given iterator. |
erase(ContainerBidirectionalIterator<TValue>, ContainerBidirectionalIterator<TValue>, ContainerBidirectionalIterator<TValue>) | Removes from the container the elements between the specified iterators. |
erase(TKey) | Removes elements from the container that match the specified key. |
find(ContainerBidirectionalIterator<TValue>, TKey) | Finds an element that matches a specified key. |
get_generation() | Gets the current change generation of the underlying container. (Inherited from IBidirectionalContainer<TValue>) |
GetEnumerator() | Returns an enumerator that iterates through a collection. (Inherited from IEnumerable) |
hash_delegate() | Returns the delegate that is used to convert a key value to an integer. |
insert(ContainerBidirectionalIterator<TValue>, ContainerBidirectionalIterator<TValue>, TValue) | Adds the given element to the container. |
insert(GenericPair<ContainerBidirectionalIterator<TValue>,Boolean>, TValue) | Adds the given value to the container. |
insert(IEnumerable) | Adds the given enumeration to the container. |
insert(IInputIterator<TValue>, IInputIterator<TValue>) | Adds to the container the elements specified by the given iterators. |
key_comp() | Returns the ordering delegate that is used to order the controlled sequence. You use it to compare two keys. |
load_factor() | Counts the average number of elements per bucket in the hash table. |
lower_bound(ContainerBidirectionalIterator<TValue>, TKey) | Finds the beginning of the range of elements that match a specified key. |
max_load_factor() | Gets the maximum number of elements per bucket in the hash table. |
max_load_factor(Single) | Sets the maximum number of elements per bucket in the hash table. |
rbegin(ReverseBidirectionalIterator<TValue>) | Designates the beginning of the reversed controlled sequence. |
rehash(Int32) | Rebuilds the hash table. |
rend(ReverseBidirectionalIterator<TValue>) | Designates the end of the reversed controlled sequence. |
size() | Counts the number of elements in the container. |
swap(IHash<TKey,TValue>) | Swaps the contents of two containers. |
upper_bound(ContainerBidirectionalIterator<TValue>, TKey) | Finds the end of the range of elements that match a specified key. |
value_comp() | Returns the ordering delegate that is used to order the controlled sequence. |
Extension Methods
Cast<TResult>(IEnumerable) | Casts the elements of an IEnumerable to the specified type. |
OfType<TResult>(IEnumerable) | Filters the elements of an IEnumerable based on a specified type. |
AsParallel(IEnumerable) | Cider mac os x download. Enables parallelization of a query. |
AsQueryable(IEnumerable) | Converts an IEnumerable to an IQueryable. |