MSDN Lists these: Dictionary<,> List<> SortedList<,> (edit: wrong link; here’s the generic version) SortedDictionary<,> etc. For example: The SortedList(TKey, TValue) generic class is a binary search tree with O(log n) retrieval, where n is the number of elements in the dictionary. In this, it is similar to the SortedDictionary(TKey, TValue) generic class. The two classes … Read more
The recommended way is to use OnlyContain: items.Should().OnlyContain(x => x.IsActive, “because I said so!”); These will also work: items.All(x => x.IsActive).Should().BeTrue(“because I said so!”); items.Select(x => x.IsActive.Should().BeTrue(“because I said so!”)) .All(x => true); Note that the last line (.All(x => true)) forces the previous Select to execute for each item.
In Spring 3.2 there is now support for generic types using the new exchange()-methods on the RestTemplate: ParameterizedTypeReference<List<MyBean>> typeRef = new ParameterizedTypeReference<List<MyBean>>() {}; ResponseEntity<List<MyBean>> response = template.exchange(“http://example.com”, HttpMethod.GET, null, typeRef); Works like a charm!
you will have to use something like below : List<ProductManager> B = A.stream() .map(developer -> new ProductManager(developer.getName(), developer.getAge())) .collect(Collectors.toList()); // for large # of properties assuming the attributes have similar names //other wise with different names refer this List<ProductManager> B = A.stream().map(developer -> { ProductManager productManager = new ProductManager(); try { PropertyUtils.copyProperties(productManager, developer); } catch … Read more
Piping is the correct way to flatten nested structures, so I’m not sure what would be more “elegant”. Yes, the syntax is a bit line-noisy looking, but frankly quite serviceable. 2020 Edit The recommended syntax these days is to expand % to ForEach-Object. A bit more verbose but definitely more readable: @($a | ForEach-Object {$_}).count
You can use Repeat: List<int> listFullOfInts = Enumerable.Repeat(42, 50).ToList(); Demo If you already have a list and you don’t want to create a new one with ToList: listFullOfInts.AddRange(Enumerable.Repeat(42, 50)); If you want to do add reference types without repeating the same reference, you can use Enumerable.Range+Select: List<SomeClass> itemList = Enumerable.Range(0, 50) .Select(i => new SomeClass()) … Read more
The ObservableCollection exposes an protected Items property which is the underlying collection without the notification semantics. This means you can build a collection that does what you want by inheriting ObservableCollection: class RangeEnabledObservableCollection<T> : ObservableCollection<T> { public void InsertRange(IEnumerable<T> items) { this.CheckReentrancy(); foreach(var item in items) this.Items.Add(item); this.OnCollectionChanged(new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Reset)); } } Usage: void Main() { … Read more
because it is equivalent to using an iterator, it is equivalent to calling the collections’ . iterator() method, and it is called once.
() – tuple A tuple is a sequence of items that can’t be changed (immutable). [] – list A list is a sequence of items that can be changed (mutable). {} – dictionary or set A dictionary is a list of key-value pairs, with unique keys (mutable). From Python 2.7/3.1, {} can also represent a … Read more
You can write your function like this: fn take<T>(mut vec: Vec<T>, index: usize) -> Option<T> { if vec.get(index).is_none() { None } else { Some(vec.swap_remove(index)) } } The code you see here (get and swap_remove) is guaranteed O(1). However, kind of hidden, vec is dropped at the end of the function and this drop operation is … Read more