PCLBag is implemented such as no order is implied for iteration over elements. The Add() method is constant cost while the Remove() function is O(n), and the IsMember() function is also O(n).
The PCLBag is considered to be a very light weight implementation consuming only enough space for a pointer to each PCLObject, and a small fixed overhead.
See Also: PCLContainer