neat deindexify for comparator

src/models/projects.coffee

@@ -5,7 +5,6 @@ mediator = require '../modules/mediator.coffee'
 stats    = require '../modules/stats.coffee'
 Model    = require '../utils/model.coffee'
 date     = require '../utils/date.coffee'
-search   = require '../utils/search.coffee'
 user     = require './user.coffee'
 
 module.exports = new Model
@@ -13,21 +12,30 @@ module.exports = new Model
   'name': 'models/projects'
 
   'data':
-    'sortBy': 'priority'
+    'sortBy': 'progress'
 
   # Return a sort order comparator.
   comparator: ->
+    { list } = @data
+
+    # Convert existing index into actual project milestone.
+    deIdx = (fn) =>
+      ([ i, j ], b) =>
+        fn list[i].milestones[j], b
+
     switch @data.sortBy
-      # Priority comparator from most delayed in days.
+      # From highest progress.
-      when 'priority' then ([ i, j ], b) =>
+      when 'progress' then deIdx (a, b) ->
-        # Convert existing index into actual proejct milestone.
-        a = @data.list[i].milestones[j]
         # By progress points.
         $ = { 'progress': { 'points': 0 } }
         a.stats ?= $ ; b.progress ?= $
 
         a.stats.progress.points - b.stats.progress.points
-      
+
+      # From most delayed in days.
+      when 'priority' then deIdx (a, b) =>
+        0
+
       # Whatever sort order...
       else -> 0
 

src/utils/search.coffee

@@ -1,23 +0,0 @@
-# Binary search implementation with a custom comparator function.
-module.exports = (arr, item, comparator) ->
-  # Numeric comparator.
-  comparator ?= (a, b) ->
-    switch
-      when a < b then -1
-      when a > b then +1
-      else 0
-
-  minIndex = 0
-  maxIndex = arr.length - 1
-  
-  while minIndex <= maxIndex
-    index = (minIndex + maxIndex) / 2 | 0
-    existing = arr[index]
-    
-    res = comparator existing, item
-    switch
-      when result < 0 then minIndex = index + 1
-      when result > 0 then maxIndex = index - 1
-      else return index
-
-  -1