Created
September 5, 2014 22:19
-
-
Save xlab/a1333fdc70203f3363dc to your computer and use it in GitHub Desktop.
Riak MapReduce built-in functions
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** Helper functions start **/ | |
| var RiakHelper = function() { | |
| return { | |
| numericSorter: function(first, second) { | |
| return first - second; | |
| } | |
| }; | |
| }(); | |
| /** Helper functions end **/ | |
| var Riak = function() { | |
| return { | |
| getClassName: function(obj) { | |
| if (obj && obj.constructor && obj.constructor.toString) { | |
| var arr = obj.constructor.toString().match(/function\s*(\w+)/); | |
| if (arr && arr.length == 2) { | |
| return arr[1]; | |
| } | |
| } | |
| return undefined; | |
| }, | |
| filterNotFound: function(values) { | |
| return values.filter(function(value, index, data) { | |
| if (typeof value === 'object') { | |
| return value['not_found'] === undefined; | |
| } | |
| else { | |
| return true; | |
| } }); | |
| }, | |
| mapValues: function(value, keyData, arg) { | |
| if (value["not_found"]) { | |
| return [value]; | |
| } | |
| var data = value["values"][0]["data"]; | |
| if (Riak.getClassName(data) !== "Array") { | |
| return [data]; | |
| } | |
| else { | |
| return data; | |
| }}, | |
| mapValuesJson: function(value, keyData, arg) { | |
| if (value["not_found"]) { | |
| return [value]; | |
| } | |
| var newValues = Riak.mapValues(value, keyData, arg); | |
| return newValues.map(function(nv) { return JSON.parse(nv); }); | |
| }, | |
| mapByFields: function(value, keyData, fields) { | |
| if(!value.not_found) { | |
| var object = Riak.mapValuesJson(value)[0]; | |
| for(field in fields) { | |
| if(object[field] != fields[field]) { | |
| return []; | |
| } | |
| } | |
| return [object]; | |
| } | |
| else { | |
| return []; | |
| } | |
| }, | |
| reduceSum: function(values, arg) { | |
| values = Riak.filterNotFound(values); | |
| if (values.length > 0) { | |
| return [values.reduce(function(prev, curr, index, array) { return prev + curr; } )]; | |
| } | |
| else { | |
| return [0]; | |
| }}, | |
| reduceMin: function(values, arg) { | |
| if(values.length == 0) | |
| return []; | |
| else | |
| return [values.reduce(function(prev,next){ | |
| return (prev < next) ? prev : next; | |
| })]; | |
| }, | |
| reduceMax: function(values, arg) { | |
| if(values.length == 0) | |
| return []; | |
| else | |
| return [values.reduce(function(prev,next){ | |
| return (prev > next) ? prev : next; | |
| })]; | |
| }, | |
| reduceSort: function(value, arg) { | |
| try { | |
| var c = eval(arg); | |
| return value.sort(c); | |
| } | |
| catch (e) { | |
| return value.sort(); | |
| } | |
| }, | |
| reduceNumericSort: function(value, arg) { | |
| value.sort(RiakHelper.numericSorter); | |
| return value; | |
| }, | |
| reduceLimit: function(value, arg) { | |
| return value.slice(0, arg - 1); | |
| }, | |
| reduceSlice: function(value, arg) { | |
| var start = arg[0]; | |
| var end = arg[1]; | |
| if (end > value.length) { | |
| return value; | |
| } | |
| else { | |
| return value.slice(start, end); | |
| } | |
| } | |
| }; | |
| }(); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment