iText 8.0.1 API
iText.Commons.Datastructures.ConcurrentWeakMap< K, V > Class Template Reference

Concurrent weak hash map implementation. More...

Inheritance diagram for iText.Commons.Datastructures.ConcurrentWeakMap< K, V >:

Public Member Functions

IEnumerator< KeyValuePair< K, V > >  GetEnumerator ()
 
void  Add (KeyValuePair< K, V > item)
 
void  Clear ()
 
bool  Contains (KeyValuePair< K, V > item)
 
void  CopyTo (KeyValuePair< K, V >[] array, int arrayIndex)
 
bool  Remove (KeyValuePair< K, V > item)
 
bool  ContainsKey (K key)
 
void  Add (K key, V value)
 
bool  Remove (K key)
 
bool  TryGetValue (K key, out V value)
 

Public Attributes

int  Count => throw new NotSupportedException(UNSUPPORTED_OPERATION)
 
bool  IsReadOnly => throw new NotSupportedException(UNSUPPORTED_OPERATION)
 
ICollection< K >  Keys => throw new NotSupportedException(UNSUPPORTED_OPERATION)
 
ICollection< V >  Values => throw new NotSupportedException(UNSUPPORTED_OPERATION)
 

Properties

this[K key] [get, set]
 

Detailed Description

Concurrent weak hash map implementation.

Template Parameters
K type of the keys
V type of the values
Type Constraints
K  : class  
V  : class  

Member Function Documentation

◆ Add() [1/2]

void iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Add ( key,
value 
)
inline

◆ Add() [2/2]

void iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Add ( KeyValuePair< K, V >  item )
inline

◆ Clear()

void iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Clear ( )
inline

◆ Contains()

bool iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Contains ( KeyValuePair< K, V >  item )
inline

◆ ContainsKey()

bool iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.ContainsKey ( key )
inline

◆ CopyTo()

void iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.CopyTo ( KeyValuePair< K, V >[]  array,
int  arrayIndex 
)
inline

◆ GetEnumerator()

IEnumerator > iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.GetEnumerator ( )
inline

◆ Remove() [1/2]

bool iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Remove ( key )
inline

◆ Remove() [2/2]

bool iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Remove ( KeyValuePair< K, V >  item )
inline

◆ TryGetValue()

bool iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.TryGetValue ( key,
out V  value 
)
inline

Member Data Documentation

◆ Count

int iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Count => throw new NotSupportedException(UNSUPPORTED_OPERATION)

◆ IsReadOnly

bool iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.IsReadOnly => throw new NotSupportedException(UNSUPPORTED_OPERATION)

◆ Keys

ICollection iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Keys => throw new NotSupportedException(UNSUPPORTED_OPERATION)

◆ Values

ICollection iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.Values => throw new NotSupportedException(UNSUPPORTED_OPERATION)

Property Documentation

◆ this[K key]

V iText.Commons.Datastructures.ConcurrentWeakMap< K, V >.this[K key]
getset