query: Filtering a list and getting first N elements
positive_passages.docid: 18758
positive_passages.text: Performance Advantages to Iterators?
negative_passages.docid: 108606
negative_passages.text: Applying a lower bound threshold on a list
negative_passages.docid: 75935
negative_passages.text: A list containing zero elements
negative_passages.docid: 652
negative_passages.text: How do you remove duplicates from a list whilst preserving order?
negative_passages.docid: 12721
negative_passages.text: Filtering collections in C#
negative_passages.docid: 65279
negative_passages.text: Split a collection into `n` parts with LINQ?
negative_passages.docid: 45413
negative_passages.text: How can I get every nth item from a List?
negative_passages.docid: 9440
negative_passages.text: How to flatten a list to return a new list with all the elements?
negative_passages.docid: 141502
negative_passages.text: Take n random elements from a List?
negative_passages.docid: 91139
negative_passages.text: Select elements of list
negative_passages.docid: 28727
negative_passages.text: Interlacing a single number into a long list
negative_passages.docid: 101729
negative_passages.text: What's the best way to get the last N elements of a Perl array?
negative_passages.docid: 18469
negative_passages.text: Idiomatic way to unpack variable length list of maximum size n
negative_passages.docid: 12620
negative_passages.text: A method to count occurrences in a list
negative_passages.docid: 41154
negative_passages.text: Select N random elements from a List in C#
negative_passages.docid: 43374
negative_passages.text: How to remove duplicates from Python list and keep order?
negative_passages.docid: 45504
negative_passages.text: Best way to select a subset of items in a long list