cornerstone-source 0.1.12 → 0.1.13

data/lib/cornerstone-source.rb

@@ -2,8 +2,15 @@ require 'sprockets'
 
 module Cornerstone
   module Source
-    root_dir = File.expand_path(File.dirname(File.dirname(__FILE__)))
+    if defined? ::Rails
+      class Engine < ::Rails::Engine
+        config.paths['app/assets'] = "source"
+      end
+    else
+      root_dir = File.expand_path(File.dirname(File.dirname(__FILE__)))
+      asset_dir = File.join(root_dir, "source")
 
-    ::Sprockets.append_path File.join(root_dir, "source")
+      ::Sprockets.append_path asset_dir
+    end
   end
 end

data/lib/cornerstone-source/version.rb

@@ -1,5 +1,5 @@
 module Cornerstone
   module Source
-    VERSION = "0.1.12"
+    VERSION = "0.1.13"
   end
 end

data/pixie.json

@@ -0,0 +1,13 @@
+{
+  "author": "STRd6",
+  "main": null,
+  "name": "Cornerstone",
+  "library": true,
+  "libs": { },
+  "directories": {
+    "lib": "lib",
+    "source": "source",
+    "test": "test"
+  },
+  "autosave": false
+}

data/source/{array_extensions.js.coffee → array_extensions.coffee}

@@ -23,7 +23,7 @@ Returns a copy of the array without null and undefined values.
 @returns {Array} A new array that contains only the non-null values.
 ###
 Array::compact = ->
-  this.select (element) ->
+  @select (element) ->
     element?
 
 ###*
@@ -46,7 +46,7 @@ the same objects.
 @returns {Array} A new array that is a copy of the array
 ###
 Array::copy = ->
-  this.concat()
+  @concat()
 
 ###*
 Empties the array of its contents. It is modified in place.
@@ -61,7 +61,7 @@ Empties the array of its contents. It is modified in place.
 @returns {Array} this, now emptied.
 ###
 Array::clear = ->
-  this.length = 0
+  @length = 0
 
   return this
 
@@ -81,7 +81,7 @@ Flatten out an array of arrays into a single array of elements.
 @returns {Array} A new array with all the sub-arrays flattened to the top.
 ###
 Array::flatten = ->
-  this.inject [], (a, b) ->
+  @inject [], (a, b) ->
     a.concat b
 
 ###*
@@ -101,7 +101,7 @@ and return a new array containing the results of the invocation.
 @returns {Array} A new array containing the results of invoking the named method on each element.
 ###
 Array::invoke = (method, args...) ->
-  this.map (element) ->
+  @map (element) ->
     element[method].apply(element, args)
 
 ###*
@@ -115,7 +115,7 @@ Randomly select an element from the array.
 @returns {Object} A random element from an array
 ###
 Array::rand = ->
-  this[rand(this.length)]
+  this[rand(@length)]
 
 ###*
 Remove the first occurrence of the given object from the array if it is
@@ -134,10 +134,10 @@ present. The array is modified in place.
 @returns {Object} The removed object if present otherwise undefined.
 ###
 Array::remove = (object) ->
-  index = this.indexOf(object)
+  index = @indexOf(object)
 
   if index >= 0
-    this.splice(index, 1)[0]
+    @splice(index, 1)[0]
   else
     undefined
 
@@ -156,7 +156,7 @@ Returns true if the element is present in the array.
 @returns {Boolean} true if the element is in the array, false otherwise.
 ###
 Array::include = (element) ->
-  this.indexOf(element) != -1
+  @indexOf(element) != -1
 
 ###*
 Call the given iterator once for each element in the array,
@@ -185,8 +185,8 @@ third argument.
 @returns {Array} this to enable method chaining.
 ###
 Array::each = (iterator, context) ->
-  if this.forEach
-    this.forEach iterator, context
+  if @forEach
+    @forEach iterator, context
   else
     for element, i in this
       iterator.call context, element, i, this
@@ -234,7 +234,7 @@ Call the given iterator once for each pair of objects in the array.
 @param {Object} [context] Optional context parameter to be used as `this` when calling the iterator function.
 ###
 Array::eachPair = (iterator, context) ->
-  length = this.length
+  length = @length
   i = 0
   while i < length
     a = this[i]
@@ -262,7 +262,7 @@ as the second argument. Additional arguments are passed similar to
 @returns {Array} this
 ###
 Array::eachWithObject = (object, iterator, context) ->
-  this.each (element, i, self) ->
+  @each (element, i, self) ->
     iterator.call context, element, object, i, self
 
   return object
@@ -290,11 +290,11 @@ passed as in each.
 ###
 Array::eachSlice = (n, iterator, context) ->
   if n > 0
-    len = (this.length / n).floor()
+    len = (@length / n).floor()
     i = -1
 
     while ++i < len
-      iterator.call(context, this.slice(i*n, (i+1)*n), i*n, this)
+      iterator.call(context, @slice(i*n, (i+1)*n), i*n, this)
 
   return this
 
@@ -312,10 +312,8 @@ is fed to the input of the second and so on until the final processed output is
 @returns {Object} The result of processing the input by each function in the array.
 ###
 Array::pipeline = (input) ->
-  for fn in this
-    input = fn(input)
-
-  return input
+  @inject input, (input, fn) ->
+    fn(input)
 
 ###*
 Returns a new array with the elements all shuffled up.
@@ -334,7 +332,7 @@ Returns a new array with the elements all shuffled up.
 Array::shuffle = ->
   shuffledArray = []
 
-  this.each (element) ->
+  @each (element) ->
     shuffledArray.splice(rand(shuffledArray.length + 1), 0, element)
 
   return shuffledArray
@@ -363,7 +361,7 @@ Returns the last element of the array, undefined if the array is empty.
 @returns {Object} The last element, or undefined if the array is empty.
 ###
 Array::last = ->
-  this[this.length - 1]
+  this[@length - 1]
 
 ###*
 Returns an object containing the extremes of this array.
@@ -376,13 +374,11 @@ Returns an object containing the extremes of this array.
 @param {Function} [fn] An optional funtion used to evaluate each element to calculate its value for determining extremes.
 @returns {Object} {min: minElement, max: maxElement}
 ###
-Array::extremes = (fn) ->
-  fn ||= (n) -> n
-
+Array::extremes = (fn=Function.identity) ->
   min = max = undefined
   minResult = maxResult = undefined
 
-  this.each (object) ->
+  @each (object) ->
     result = fn(object)
 
     if min?
@@ -404,6 +400,31 @@ Array::extremes = (fn) ->
   min: min
   max: max
 
+Array::maxima = (valueFunction=Function.identity) ->
+  @inject([-Infinity, []], (memo, item) ->
+    value = valueFunction(item)
+    [maxValue, maxItems] = memo
+
+    if value > maxValue
+      [value, [item]]
+    else if value is maxValue
+      [value, maxItems.concat(item)]
+    else
+      memo
+  ).last()
+
+Array::maximum = (valueFunction) ->
+  @maxima(valueFunction).first()
+
+Array::minima = (valueFunction=Function.identity) ->
+  inverseFn = (x) ->
+    -valueFunction(x)
+
+  @maxima(inverseFn)
+
+Array::minimum = (valueFunction) ->
+  @minima(valueFunction).first()
+
 ###*
 Pretend the array is a circle and grab a new array containing length elements.
 If length is not given return the element at start, again assuming the array
@@ -461,7 +482,7 @@ Array::partition = (iterator, context) ->
   trueCollection = []
   falseCollection = []
 
-  this.each (element) ->
+  @each (element) ->
     if iterator.call(context, element)
       trueCollection.push element
     else
@@ -479,7 +500,7 @@ Return the group of elements for which the return value of the iterator is true.
 @returns {Array} An array containing the elements for which the iterator returned true.
 ###
 Array::select = (iterator, context) ->
-  return this.partition(iterator, context)[0]
+  return @partition(iterator, context)[0]
 
 ###*
 Return the group of elements that are not in the passed in set.
@@ -493,7 +514,7 @@ Return the group of elements that are not in the passed in set.
 @returns {Array} An array containing the elements that are not passed in.
 ###
 Array::without = (values) ->
-  this.reject (element) ->
+  @reject (element) ->
     values.include(element)
 
 ###*
@@ -506,7 +527,7 @@ Return the group of elements for which the return value of the iterator is false
 @returns {Array} An array containing the elements for which the iterator returned false.
 ###
 Array::reject = (iterator, context) ->
-  this.partition(iterator, context)[1]
+  @partition(iterator, context)[1]
 
 ###*
 Combines all elements of the array by applying a binary operation.
@@ -518,7 +539,7 @@ value (memo) and the element.
 @returns {Object} The result of a
 ###
 Array::inject = (initial, iterator) ->
-  this.each (element) ->
+  @each (element) ->
     initial = iterator(initial, element)
 
   return initial
@@ -534,7 +555,7 @@ Add all the elements in the array.
 @returns {Number} The sum of the elements in the array.
 ###
 Array::sum = ->
-  this.inject 0, (sum, n) ->
+  @inject 0, (sum, n) ->
     sum + n
 
 ###*
@@ -548,7 +569,7 @@ Multiply all the elements in the array.
 @returns {Number} The product of the elements in the array.
 ###
 Array::product = ->
-  this.inject 1, (product, n) ->
+  @inject 1, (product, n) ->
     product * n
 
 ###*
@@ -562,7 +583,7 @@ Merges together the values of each of the arrays with the values at the correspo
 @returns {Array} Array groupings whose values are arranged by their positions in the original input arrays.
 ###
 Array::zip = (args...) ->
-  this.map (element, index) ->
+  @map (element, index) ->
     output = args.map (arr) ->
       arr[index]
 

data/source/{function_extensions.js.coffee → function_extensions.coffee}

@@ -11,11 +11,11 @@ Function::once = ->
     return memo = func.apply(this, arguments)
 
 ###*
-Calling a debounced function will postpone its execution until after 
-wait milliseconds have elapsed since the last time the function was 
-invoked. Useful for implementing behavior that should only happen after 
-the input has stopped arriving. For example: rendering a preview of a 
-Markdown comment, recalculating a layout after the window has stopped 
+Calling a debounced function will postpone its execution until after
+wait milliseconds have elapsed since the last time the function was
+invoked. Useful for implementing behavior that should only happen after
+the input has stopped arriving. For example: rendering a preview of a
+Markdown comment, recalculating a layout after the window has stopped
 being resized...
 
     lazyLayout = calculateLayout.debounce(300)
@@ -58,3 +58,10 @@ Function::delay = (wait, args...) ->
 Function::defer = (args...) ->
   this.delay.apply this, [1].concat(args)
 
+Object.extend Function,
+
+  identity: (x) ->
+    x
+
+  noop: ->
+

data/source/{number_extensions.js.coffee → number_extensions.coffee}

@@ -1,4 +1,4 @@
-###* 
+###*
 Returns the absolute value of this number.
 
     (-4).abs()
@@ -8,18 +8,16 @@ Returns the absolute value of this number.
 @methodOf Number#
 @returns {Number} The absolute value of the number.
 ###
-Number::abs = () ->
-  Math.abs(this)
 
 ###*
 Returns the mathematical ceiling of this number.
 
-    4.9.ceil() 
+    4.9.ceil()
     # => 5
-    
+
     4.2.ceil()
     # => 5
-    
+
     (-1.2).ceil()
     # => -1
 
@@ -27,18 +25,16 @@ Returns the mathematical ceiling of this number.
 @methodOf Number#
 @returns {Number} The number truncated to the nearest integer of greater than or equal value.
 ###
-Number::ceil = ->
-  Math.ceil(this)
 
 ###*
 Returns the mathematical floor of this number.
 
     4.9.floor()
     # => 4
-    
+
     4.2.floor()
     # => 4
-    
+
     (-1.2).floor()
     # => -2
 
@@ -46,15 +42,13 @@ Returns the mathematical floor of this number.
 @methodOf Number#
 @returns {Number} The number truncated to the nearest integer of less than or equal value.
 ###
-Number::floor = ->
-  Math.floor(this)
 
 ###*
 Returns this number rounded to the nearest integer.
 
     4.5.round()
     # => 5
-    
+
     4.4.round()
     # => 4
 
@@ -62,14 +56,16 @@ Returns this number rounded to the nearest integer.
 @methodOf Number#
 @returns {Number} The number rounded to the nearest integer.
 ###
-Number::round = ->
-  Math.round(this)
+
+["abs", "ceil", "floor", "round"].each (method) ->
+  Number::[method] = ->
+    Math[method](this)
 
 ###*
 Get a bunch of points equally spaced around the unit circle.
 
     4.circularPoints (p) ->
-    
+
     # p gets Point(1, 0), Point(0, 1), Point(-1, 0), Point(0, -1)
 
 @name circularPoint
@@ -130,10 +126,10 @@ Get the sign of this number as an integer (1, -1, or 0).
 
     (-5).sign()
     # => -1
-    
+
     0.sign()
     # => 0
-    
+
     5.sign()
     # => 1
 
@@ -146,7 +142,7 @@ Number::sign = ->
     1
   else if this < 0
     -1
-  else 
+  else
     0
 
 ###*
@@ -154,51 +150,48 @@ Returns true if this number is even (evenly divisible by 2).
 
     2.even()
     # => true
-    
+
     3.even()
     # => false
-    
+
     0.even()
-    # => true      
+    # => true
 
 @name even
 @methodOf Number#
 @returns {Boolean} true if this number is an even integer, false otherwise.
 ###
 Number::even = ->
-  this % 2 == 0
+  @mod(2) is 0
 
 ###*
 Returns true if this number is odd (has remainder of 1 when divided by 2).
 
     2.odd()
     # => false
-    
+
     3.odd()
     # => true
-    
+
     0.odd()
-    # => false     
+    # => false
 
 @name odd
 @methodOf Number#
 @returns {Boolean} true if this number is an odd integer, false otherwise.
 ###
 Number::odd = ->
-  if this > 0
-    this % 2 == 1
-  else
-    this % 2 == -1
+  @mod(2) is 1
 
 ###*
-Calls iterator the specified number of times, passing in the number of the 
-current iteration as a parameter: 0 on first call, 1 on the second call, etc. 
+Calls iterator the specified number of times, passing in the number of the
+current iteration as a parameter: 0 on first call, 1 on the second call, etc.
 
     output = []
-    
+
     5.times (n) ->
       output.push(n)
-    
+
     output
     # => [0, 1, 2, 3, 4]
 
@@ -217,15 +210,15 @@ Number::times = (iterator, context) ->
   return i
 
 ###*
-Returns the the nearest grid resolution less than or equal to the number. 
+Returns the the nearest grid resolution less than or equal to the number.
 
-    7.snap(8) 
+    7.snap(8)
     # => 0
-    
-    4.snap(8) 
+
+    4.snap(8)
     # => 0
-    
-    12.snap(8) 
+
+    12.snap(8)
     # => 8
 
 @name snap
@@ -246,7 +239,7 @@ Floors the number for purposes of factorization.
 
     60.primeFactors()
     # => [2, 2, 3, 5]
-    
+
     37.primeFactors()
     # => [37]
 
@@ -257,7 +250,7 @@ Floors the number for purposes of factorization.
 Number::primeFactors = ->
   factors = []
 
-  n = Math.floor(this)
+  n = @floor()
 
   if n == 0
     return undefined
@@ -283,15 +276,15 @@ Number::primeFactors = ->
   return factors
 
 ###*
-Returns the two character hexidecimal 
+Returns the two character hexidecimal
 representation of numbers 0 through 255.
 
     255.toColorPart()
     # => "ff"
-    
+
     0.toColorPart()
     # => "00"
-    
+
     200.toColorPart()
     # => "c8"
 
@@ -300,7 +293,7 @@ representation of numbers 0 through 255.
 @returns {String} Hexidecimal representation of the number
 ###
 Number::toColorPart = ->
-  s = parseInt(this.clamp(0, 255), 10).toString(16)
+  s = parseInt(@clamp(0, 255), 10).toString(16)
 
   if s.length == 1
     s = '0' + s
@@ -312,14 +305,14 @@ Returns a number that is maxDelta closer to target.
 
     255.approach(0, 5)
     # => 250
-    
+
     5.approach(0, 10)
     # => 0
 
 @name approach
 @methodOf Number#
 @returns {Number} A number maxDelta toward target
-###    
+###
 Number::approach = (target, maxDelta) ->
   (target - this).clamp(-maxDelta, maxDelta) + this
 
@@ -332,9 +325,9 @@ Returns a number that is closer to the target by the ratio.
 @name approachByRatio
 @methodOf Number#
 @returns {Number} A number toward target by the ratio
-### 
+###
 Number::approachByRatio = (target, ratio) ->
-  this.approach(target, this * ratio)
+  @approach(target, this * ratio)
 
 ###*
 Returns a number that is closer to the target angle by the delta.
@@ -345,7 +338,7 @@ Returns a number that is closer to the target angle by the delta.
 @name approachRotation
 @methodOf Number#
 @returns {Number} A number toward the target angle by maxDelta
-### 
+###
 Number::approachRotation = (target, maxDelta) ->
   while target > this + Math.PI
     target -= Math.TAU
@@ -358,7 +351,7 @@ Number::approachRotation = (target, maxDelta) ->
 ###*
 Constrains a rotation to between -PI and PI.
 
-    (9/4 * Math.PI).constrainRotation() 
+    (9/4 * Math.PI).constrainRotation()
     # => 0.7853981633974483 # this is (1/4) * Math.PI
 
 @name constrainRotation
@@ -376,6 +369,15 @@ Number::constrainRotation = ->
 
   return target
 
+# TODO Test and document
+Number::truncate = ->
+  if this > 0
+    @floor()
+  else if this < 0
+    @ceil()
+  else
+    this
+
 ###*
 The mathematical d operator. Useful for simulating dice rolls.
 
@@ -386,7 +388,7 @@ The mathematical d operator. Useful for simulating dice rolls.
 Number::d = (sides) ->
   sum = 0
 
-  this.times ->
+  @times ->
     sum += rand(sides) + 1
 
   return sum
@@ -396,7 +398,7 @@ Utility method to convert a number to a duration of seconds.
 
     3.seconds
     # => 3000
-    
+
     setTimout doSometing, 3.seconds
 
 @name seconds
@@ -405,12 +407,12 @@ Utility method to convert a number to a duration of seconds.
 ###
 unless 5.seconds
   Object.defineProperty Number::, 'seconds',
-    get: -> 
+    get: ->
       this * 1000
 
 unless 1.second
   Object.defineProperty Number::, 'second',
-    get: -> 
+    get: ->
       this * 1000
 
 ###*
@@ -418,7 +420,7 @@ Utility method to convert a number to an amount of rotations.
 
     0.5.rotations
     # => 3.141592653589793
-    
+
     I.rotation = 0.25.rotations
 
 @name rotations
@@ -427,12 +429,12 @@ Utility method to convert a number to an amount of rotations.
 ###
 unless 5.rotations
   Object.defineProperty Number::, 'rotations',
-    get: -> 
+    get: ->
       this * Math.TAU
 
 unless 1.rotation
   Object.defineProperty Number::, 'rotation',
-    get: -> 
+    get: ->
       this * Math.TAU
 
 ###*
@@ -440,9 +442,9 @@ Utility method to convert a number to an amount of rotations.
 
     0.5.turns
     # => 3.141592653589793
-    
+
     I.rotation = 0.25.turns
-    
+
     1.turn # => Math.TAU (aka 2 * Math.PI)
 
 @name turns
@@ -452,12 +454,12 @@ Utility method to convert a number to an amount of rotations.
 ###
 unless 5.turns
   Object.defineProperty Number.prototype, 'turns',
-    get: -> 
+    get: ->
       this * Math.TAU
 
 unless 1.turn
   Object.defineProperty Number.prototype, 'turn',
-    get: -> 
+    get: ->
       this * Math.TAU
 
 ###*
@@ -465,7 +467,7 @@ Utility method to convert a number to an amount of degrees.
 
     180.degrees
     # => 3.141592653589793
-    
+
     I.rotation = 90.degrees
 
 @name degrees
@@ -474,15 +476,15 @@ Utility method to convert a number to an amount of degrees.
 ###
 unless 2.degrees
   Object.defineProperty Number::, 'degrees',
-    get: -> 
+    get: ->
       this * Math.TAU / 360
 
 unless 1.degree
   Object.defineProperty Number::, 'degree',
-    get: -> 
+    get: ->
       this * Math.TAU / 360
 
-###* 
+###*
 The mathematical circle constant of 1 turn.
 
 @name TAU