Wintellect's power Collections Library
Biglist <string> STR = New Biglist <string> ();
Str. Add ( " Ddddddddddddd <br/> " );
Str. Add ( " Dddddddddd " );
Foreach ( VaR Item In Str)
{
Response. Write (item );
}
Biglist <t> ordered t object set. It is highly efficient to operate more than 100 data items.
Bag < Int > Bag = New Bag < Int > ();
Bag. Add ( 1 );
Bag. Add ( 1 );
Bag. Add ( 2 );
Bag. Add ( 7 );
Foreach ( VaR Item In Bag)
{
Response. Write (item + " <Br/> " );
}
A collection of unordered T objects. The collection is hashed and repeated items are allowed.
Orderedbag < Int > Ordbag = New Orderedbag < Int > ();
Ordbag. Add ( 1 );
Ordbag. Add ( 1 );
Ordbag. Add ( 2 );
Ordbag. Add ( 7 );
Foreach ( VaR Item In Ordbag)
{
Response. Write (item + " <Br/> " );
}
Orderedbag <t> A set of ordered t objects. Repeated values are allowed.
Set < Int > Set = New Set < Int > ();
Set . Add ( 1 );
Set . Add ( 1 );
Set . Add ( 2 );
Set . Add ( 7 );
Foreach ( VaR Item In Set )
{
Response. Write (item + " <Br/> " );
}
Set <t> unordered t data item set. Repeated items are not allowed. After you add duplicate items, only one record is retained.
Orderedset < Int > Ordset = New Orderedset < Int > ();
Ordset. Add ( 0 );
Ordset. Add ( 1 );
Ordset. Add ( 2 );
Ordset. Add ( 7 );
Foreach ( VaR Item In Ordset)
{
Response. Write (item + " <Br/> " );
}
Orderedset <t> A set of ordered t data items. Repeated items are not allowed.
Deque < Int > DEQ = New Deque < Int > ();
DEQ. addtoback ( 0 );
DEQ. addtoback ( 1 );
DEQ. addtofront ( 2 );
DEQ. addtofront ( 7 );
Foreach ( VaR Item In DEQ)
{
Response. Write (item + " <Br/> " );
}
Deque <t> double-ending queue ). It is similar to a list, but it is more efficient than a list to add or delete data items at the beginning.
Ordereddictionary <string, string> ordic = New Ordereddictionary < String , String > ();
Ordic. Add ( " 1 " , " 1 " );
Ordic. Add ( " 3 " , " 3 " );
Ordic. Add ( " 2 " , " 2 " );
Foreach ( String Key In Ordic. Keys)
{
Response. Write (ordic [Key] + " <Br/> " );
}
Ordereddictionary <tkey, tvalue> dictionary. The keys are sorted and each key has a corresponding value.
Multidictionary <string, string> muldic = New Multidictionary <string, string> ( True );
Muldic. Add ( " 1 " , " 1 " );
Muldic. Add ( " 1 " , " 0 " );
Muldic. Add ( " 3 " , " 3 " );
Muldic. Add ( " 2 " , " 2 " );
Foreach ( String Key In Muldic. Keys)
{
Response. Write (muldic [Key] + " <Br/> " );
}
Multidictionary <tkey, tvalue> dictionary. Each key can have multiple values, which are hashed to allow duplication and data items are unordered.
Orderedmultidictionary <string, string> ordmudic = New Orderedmultidictionary < String , String > ( True );
Ordmudic. Add ( " 1 " , " 1 " );
Ordmudic. Add ( " 1 " , " 0 " );
Ordmudic. Add ( " 3 " , " 3 " );
Ordmudic. Add ( " 2 " , " 2 " );
Foreach ( String Key In Ordmudic. Keys)
{
Response. Write (ordmudic [Key] + " <Br/> " );
}
Orderedmultidictionary <tkey, tvalue> dictionary. The keys are sorted. Each key can have multiple values (which are also sorted ). Duplicate keys are allowed.
Class Library: http://powercollections.codeplex.com/