OReilly Concurrency in C# Cookbook (2014) by 未知

Author:未知
Format: epub
Published: 0101-01-01T00:00:00+00:00

Solution

Immutable stacks and queues are the simplest immutable collections. They behave very similarly to the standard Stack<T> and Queue<T>. Performance-wise, immutable stacks and queues have the same time complexity as standard stacks and queues; however, in simple scenarios where the collections are updated frequently, the standard stack and queue are faster.

Stacks are a first-in, first-out data structure. The following code creates an empty immutable stack, pushes two items, enumerates the items, and then pops an item:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.