containers

is there in C# some already defined generic container which can be used as Stack and as Queue at the same time? I just want to be able to append elements either to the end, or to the front of the queue thanks Check the LinkedList class. LinkedList<int> list = new LinkedList<int>(); list.AddFirst(1); list.AddLast(2); list.AddFirst(0); Here's my implementation of an immutable deque : http://blogs.msdn.com/ericlippert/archive/2008/02/12/immutability-in-c-part-eleven-a-working-double-ended-queue.aspx Notice that this is an immutable double-ended-queue. Normally you probably think of a queue as

I have some library of classes, working with my data, which is being read into buffer. Is it possible somehow to avoid copying arrays again and again, passing parts of data deeper and deeper into processing methods? Well, it sounds strange, but in my particular case, there's a special writer, which divides data into blocks and writes them individually into different locations, so it just performs System.arraycopy, gets what it needs and calls underlying writer, with that new sub array. And this happens many times. What is the best approach to refactor such code? Many classes in Java accept a

I need to wrap a dynamically allocated array(from a = new double[100] for example) into std::vector(preferably) without copying the array. This restriction is imposed by that the array I want to wrap is mmaped from a file, so just doing vector(a, a+size) will double the memory usage. Is any tricks to do that? One of the best solutions for this is something like STLSoft's array_proxy<> template. Unfortunately, the doc page generated from the source code by doxygen isn't a whole lot of help understanding the template. The source code might actually be a bit better: http://www.stlsoft.org/doc-1.9

I know it's possible by using pulse audio on a Linux host system But paprefs is built for linux not mac. The Docker-for-Mac VM doesn't have any sound passthrough device, so there isn't anything that you could take advantage of from that angle. By contrast, a virtualbox or vmware fusion VM does have the ability to do passthrough audio. I was able to get pulseaudio installed and working on OSX with the following command: brew install pulseaudio I was able to verify this worked by running the following, hearing sound come out of my speakers: paplay cockatiel.wav My next step is to find an image

Can someone point out a good mapping between the usual C++ STL containers such as vector, list, map, set, multimap... and the C# generic containers? I'm used to the former ones and somehow I've accustomed myself to express algorithms in terms of those containers. I'm having some hard time finding the C# equivalent to those. Thank you! Scott Wisniewski Here's a rough equivalence: Dictionary<K,V> <=> unordered_map<K,V> HashSet<T> <=> unordered_set<T> List<T> <=> vector<T> LinkedList<T> <=> list<T> The .NET BCL (base class library) does not have red-black trees (stl map) or priority queues (make

I have an std::map and I want to search for a key using a substring. For example, I have the following code: #include <iostream> #include <map> #include <string> using namespace std; typedef std::map<std::string, std::string> TStrStrMap; typedef std::pair<std::string, std::string> TStrStrPair; int main(int argc, char *argv[]) { TStrStrMap tMap; tMap.insert(TStrStrPair("John", "AA")); tMap.insert(TStrStrPair("Mary", "BBB")); tMap.insert(TStrStrPair("Mother", "A")); tMap.insert(TStrStrPair("Marlon", "C")); return 0; } Now, I want to search for the position that holds the substring "Marl" and not