query: Big-Oh notation for Java Collections
positive_passages.docid: 9384
positive_passages.text: Big-O summary for Java Collections Framework implementations?
negative_passages.docid: 2396
negative_passages.text: Order-preserving injections of ordinals into $[0,1]$
negative_passages.docid: 59070
negative_passages.text: How to create a deep unmodifiable collection?
negative_passages.docid: 43175
negative_passages.text: Is there an O(n) integer sorting algorithm?
negative_passages.docid: 101869
negative_passages.text: Field Extension Notation
negative_passages.docid: 60953
negative_passages.text: How could we formalize the introduction of new notation?
negative_passages.docid: 76162
negative_passages.text: Does Scala's pattern matching violate the Open/Closed Principle?
negative_passages.docid: 133468
negative_passages.text: Assign zeros to large list of indexed variables
negative_passages.docid: 66038
negative_passages.text: How can I efficiently generate a Set from a List structure?
negative_passages.docid: 99385
negative_passages.text: How to list all collections and their objects?
negative_passages.docid: 106603
negative_passages.text: How to tell if an array is a permutation in O(n)?
negative_passages.docid: 71079
negative_passages.text: Big class decomposition in Java
negative_passages.docid: 145120
negative_passages.text: What is the performance of the Last() extension method for List?
negative_passages.docid: 100262
negative_passages.text: Improved Van Emde Boas tree based map in Java
negative_passages.docid: 130868
negative_passages.text: rewrite access to collection to avoid "double" finding
negative_passages.docid: 67068
negative_passages.text: Why is T bounded by Object in the Collections.max() signature?
negative_passages.docid: 44885
negative_passages.text: Java BigInteger