Basic Collections - Conclusion

(Page 6 of 6 )

Conclusion

As was said earlier, objects often come in groups of related objects. Sometimes, these groups can be organized with simple arrays. Other times, however, more dynamic, complex or creative organization is required. Collections provide this functionality, and generic collections add the benefit of type safety. In this article, we only covered lists, queues, stacks and dictionaries. However, there are many more kinds of collections, and it is even possible to create custom collections should they be needed. Here is a final summary of the collections we covered:

Lists

• Each element features a zero-based integer index

• Works similarly to an array

Queues

• First-in-first-out (FIFO)

• Elements do not features indexes

• New elements are enqueued

• The first element may be dequeued or peeked at

Stacks

• Last-in-first-out (LIFO)

• Elements do not feature indexes

• New elements are pushed

• The last element may be popped or peeked at

Dictionaries

• Each element is made up of a key and an associated value

• Values are accessed through keys

• KeyValuePair is used for looping

DISCLAIMER: The content provided in this article is not warranted or guaranteed by Developer Shed, Inc. The content provided is intended for entertainment and/or educational purposes in order to introduce to the reader key ideas, concepts, and/or product reviews. As such it is incumbent upon the reader to employ real-world tactics for security and implementation of best practices. We are not liable for any negative consequences that may result from implementing any information covered in our articles or tutorials. If this is a hardware review, it is not recommended to open and/or modify your hardware.

Comments On: Basic Collections

· Hello,This is an introduction to basic collections, with an emphasis on generic...   >>> Post your comment now!