Here is a possible implementation in Swift using binary search (from http://rosettacode.org/wiki/Binary_search#Swift with slight modifications): extension Array { func insertionIndexOf(_ elem: Element, isOrderedBefore: (Element, Element) -> Bool) -> Int { var lo = 0 var hi = self.count – 1 while lo <= hi { let mid = (lo + hi)/2 if isOrderedBefore(self[mid], elem) { … Read more
The sorting part can be done by implementing a custom Comparator<Vehicle>. Collections.sort(vehiclearray, new Comparator<Vehicle>() { public int compare(Vehicle v1, Vehicle v2) { return v1.getEmail().compareTo(v2.getEmail()); } }); This anonymous class will be used for sorting the Vehicle objects in the ArrayList on the base of their corresponding emails alphabetically. Upgrading to Java8 will let you also … Read more
For recent first: this.data.sort((a, b) => new Date(b.date1).getTime() – new Date(a.date1).getTime()); For OlderFirst: this.data.sort((b, a) => new Date(b.date1).getTime() – new Date(a.date1).getTime());
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.
Microsoft Connect Discussion Here is some code to workaround: static int CompareStringUsingSortKey(string s1, string s2) { SortKey sk1 = CultureInfo.InvariantCulture.CompareInfo.GetSortKey(s1); SortKey sk2 = CultureInfo.InvariantCulture.CompareInfo.GetSortKey(s2); return SortKey.Compare(sk1, sk2); }
There is a recipe for sorting files larger than RAM on this page, though you’d have to adapt it for your case involving CSV-format data. There are also links to additional resources there. Edit: True, the file on disk is not “larger than RAM”, but the in-memory representation can easily become much larger than available … Read more
KEYDEF is F[.C][OPTS][,F[.C][OPTS]] for start and stop position, where F is a field number and C a character position in the field; both are origin 1, and the stop position defaults to the line’s end. If neither -t nor -b is in effect, characters in a field are counted from the beginning of the preceding … Read more
See uniq -c. You’ll want to pull out the bit you want, sort the result, pipe thru uniq, sort the output. Something like this maybe: egrep ‘\.[0-9]+:’ output.txt | sort | uniq -c | sort -nr Clarification: I’ve used grep here because it’s not clear what your output.txt format looks like, but you’ll want to … Read more
The ideal way would be to normalize your design and split the two components of the column into two separate columns. One of type integer, one text. With the current table, you could: SELECT col FROM tbl ORDER BY (substring(col, ‘^[0-9]+’))::int — cast to integer , substring(col, ‘[^0-9_].*$’); — works as text The same substring() … Read more
You don’t need post. Pass the filter value and order_by in the url for example: …/update/list/?filter=filter-val&orderby=order-val and get the filter and orderby in the get_queryset like: class MyView(ListView): model = Update template_name = “updates/update.html” paginate_by = 10 def get_queryset(self): filter_val = self.request.GET.get(‘filter’, ‘give-default-value’) order = self.request.GET.get(‘orderby’, ‘give-default-value’) new_context = Update.objects.filter( state=filter_val, ).order_by(order) return new_context def … Read more