You cannot store arrays in vectors (or in any other standard library container). The things that standard library containers store must be copyable and assignable, and arrays are neither of these. If you really need to put an array in a vector (and you probably don’t – using a vector of vectors or a vector … Read more
This sort of statement is ridiculous; people making it are either incredibly uninformed, or incredibly dishonest. In particular: The speed of dynamic memory allocation in the two cases will depend on the pattern of dynamic memory use, as well as the implementation. It is trivial for someone familiar with the algorithms used in both cases … Read more
You can try Subject[] subjects = new Subject[2]; subjects[0] = new Subject{….}; subjects[1] = new Subject{….}; alternatively you can use List List<Subject> subjects = new List<Subject>(); subjects.Add(new Subject{….}); subjects.Add(new Subject{….}); // Then you can convert the List to Array like below: Subject[] arraySubjects = subjects.ToArray<Subject>()
List unmodifiableList = Collections.unmodifiableList(list); List newList = new ArrayList(unmodifiableList); Collections.sort(newList); The constructor of ArrayList takes an existing list, reads its elements (without modifying them!), and adds them to the new List.
If you want a simple design, essentially I would do it in a static mapper class. We definitely need more information to help you, but short of that, here is some psuedocode (not production code) that should be a sufficient design pattern. public static class CustomMapper { public static void leadToContact(Lead lead, ID contactID) { … Read more
There are a couple of potential possibilities, here. First, BlockingCollection<T> in the Reactive Extensions is a backport, and not exactly the same as the .NET 4 final version. I wouldn’t be surprised if the performance of this backport differs from .NET 4 RTM (though I haven’t profiled this collection, specifically). Much of the TPL performs … Read more
You can use Vec‘s extend method. extend takes a value of any type that implements IntoIterator (which includes all iterator types) and extends the Vec by all elements returned from the iterator: vector.extend(it) Since extend belongs to the Extend trait, it also works for many other collection types.
.NET has a number of set operations that work on enumerables, so you could take the set intersection to find members in both lists. Use Any() to find out if the resulting sequence has any entries. E.g. if(list1.Intersect(list2).Any())
You could use the set comparer provided by HashSet<T>: var myDictionary = new Dictionary<HashSet<T>, TValue>(HashSet<T>.CreateSetComparer());
This is really a two part question. 1) Is there inherently anything wrong with returning an IEnumerable<T> No nothing at all. In fact if you are using C# iterators this is the expected behavior. Converting it to a List<T> or another collection class pre-emptively is not a good idea. Doing so is making an assumption … Read more