2012-11-30 18:33:32 +01:00
|
|
|
var util = (function () {
|
|
|
|
|
|
|
|
var exports = {};
|
|
|
|
|
|
|
|
// From MDN: https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Global_Objects/Math/random
|
|
|
|
exports.random_int = function random_int(min, max) {
|
|
|
|
return Math.floor(Math.random() * (max - min + 1)) + min;
|
|
|
|
};
|
|
|
|
|
2013-02-20 00:49:21 +01:00
|
|
|
// Like C++'s std::lower_bound. Returns the first index at which
|
|
|
|
// `value` could be inserted without changing the ordering. Assumes
|
|
|
|
// the array is sorted.
|
|
|
|
//
|
|
|
|
// `first` and `last` are indices and `less` is an optionally-specified
|
|
|
|
// function that returns true if
|
|
|
|
// array[i] < value
|
|
|
|
// for some i and false otherwise.
|
|
|
|
//
|
|
|
|
// Usage: lower_bound(array, value, [less])
|
|
|
|
// lower_bound(array, first, last, value, [less])
|
|
|
|
exports.lower_bound = function (array, arg1, arg2, arg3, arg4) {
|
|
|
|
var first, last, value, less;
|
|
|
|
if (arg3 === undefined) {
|
|
|
|
first = 0;
|
|
|
|
last = array.length;
|
|
|
|
value = arg1;
|
|
|
|
less = arg2;
|
|
|
|
} else {
|
|
|
|
first = arg1;
|
|
|
|
last = arg2;
|
|
|
|
value = arg3;
|
|
|
|
less = arg4;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (less === undefined) {
|
|
|
|
less = function (a, b) { return a < b; };
|
|
|
|
}
|
|
|
|
|
|
|
|
var len = last - first;
|
|
|
|
var middle;
|
|
|
|
var step;
|
|
|
|
var lower = 0;
|
|
|
|
while (len > 0) {
|
|
|
|
step = Math.floor(len / 2);
|
|
|
|
middle = first + step;
|
2014-03-11 20:17:33 +01:00
|
|
|
if (less(array[middle], value, middle)) {
|
2013-02-20 00:49:21 +01:00
|
|
|
first = middle;
|
|
|
|
first++;
|
|
|
|
len = len - step - 1;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
len = step;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return first;
|
|
|
|
};
|
|
|
|
|
2013-02-26 23:09:15 +01:00
|
|
|
exports.same_stream_and_subject = function util_same_stream_and_subject(a, b) {
|
2013-04-08 17:58:29 +02:00
|
|
|
// Streams and subjects are case-insensitive.
|
2013-04-18 17:13:43 +02:00
|
|
|
return ((a.stream.toLowerCase() === b.stream.toLowerCase()) &&
|
2013-02-26 23:09:15 +01:00
|
|
|
(a.subject.toLowerCase() === b.subject.toLowerCase()));
|
|
|
|
};
|
|
|
|
|
2014-02-12 21:07:22 +01:00
|
|
|
exports.same_major_recipient = function (a, b) {
|
|
|
|
// Same behavior as same_recipient, except that it returns true for messages
|
|
|
|
// on different topics but the same stream.
|
|
|
|
if ((a === undefined) || (b === undefined)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (a.type !== b.type) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (a.type) {
|
|
|
|
case 'private':
|
|
|
|
return a.reply_to === b.reply_to;
|
|
|
|
case 'stream':
|
|
|
|
return a.stream.toLowerCase() === b.stream.toLowerCase();
|
|
|
|
}
|
|
|
|
|
|
|
|
// should never get here
|
|
|
|
return false;
|
|
|
|
};
|
|
|
|
|
2013-02-26 23:09:15 +01:00
|
|
|
exports.same_recipient = function util_same_recipient(a, b) {
|
2013-08-01 17:47:48 +02:00
|
|
|
if ((a === undefined) || (b === undefined)) {
|
2013-02-26 23:09:15 +01:00
|
|
|
return false;
|
2013-08-01 17:47:48 +02:00
|
|
|
}
|
|
|
|
if (a.type !== b.type) {
|
2013-02-26 23:09:15 +01:00
|
|
|
return false;
|
2013-08-01 17:47:48 +02:00
|
|
|
}
|
2013-02-26 23:09:15 +01:00
|
|
|
|
|
|
|
switch (a.type) {
|
|
|
|
case 'private':
|
|
|
|
return a.reply_to === b.reply_to;
|
|
|
|
case 'stream':
|
|
|
|
return exports.same_stream_and_subject(a, b);
|
|
|
|
}
|
|
|
|
|
|
|
|
// should never get here
|
|
|
|
return false;
|
|
|
|
};
|
|
|
|
|
|
|
|
exports.same_sender = function util_same_sender(a, b) {
|
|
|
|
return ((a !== undefined) && (b !== undefined) &&
|
|
|
|
(a.sender_email === b.sender_email));
|
|
|
|
};
|
|
|
|
|
2013-06-17 20:31:31 +02:00
|
|
|
exports.normalize_recipients = function (recipients) {
|
2013-07-26 20:27:06 +02:00
|
|
|
// Converts a string listing emails of message recipients
|
|
|
|
// into a canonical formatting: emails sorted ASCIIbetically
|
|
|
|
// with exactly one comma and no spaces between each.
|
2013-07-29 23:35:36 +02:00
|
|
|
recipients = _.map(recipients.split(','), $.trim);
|
2013-07-29 22:49:42 +02:00
|
|
|
recipients = _.filter(recipients, function (s) { return s.length > 0; });
|
2013-06-17 20:31:31 +02:00
|
|
|
recipients.sort();
|
|
|
|
return recipients.join(',');
|
|
|
|
};
|
|
|
|
|
2013-03-28 22:32:17 +01:00
|
|
|
// Avoid URI decode errors by removing characters from the end
|
|
|
|
// one by one until the decode succeeds. This makes sense if
|
|
|
|
// we are decoding input that the user is in the middle of
|
|
|
|
// typing.
|
|
|
|
exports.robust_uri_decode = function (str) {
|
|
|
|
var end = str.length;
|
|
|
|
while (end > 0) {
|
|
|
|
try {
|
|
|
|
return decodeURIComponent(str.substring(0, end));
|
|
|
|
} catch (e) {
|
2013-08-01 17:47:48 +02:00
|
|
|
if (!(e instanceof URIError)) {
|
2013-03-28 22:32:17 +01:00
|
|
|
throw e;
|
2013-08-01 17:47:48 +02:00
|
|
|
}
|
2013-03-28 22:32:17 +01:00
|
|
|
end--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return '';
|
|
|
|
};
|
|
|
|
|
2013-05-03 19:16:50 +02:00
|
|
|
// If we can, use a locale-aware sorter. However, if the browser
|
|
|
|
// doesn't support the ECMAScript Internationalization API
|
|
|
|
// Specification, do a dumb string comparison because
|
|
|
|
// String.localeCompare is really slow.
|
|
|
|
exports.strcmp = (function () {
|
|
|
|
try {
|
|
|
|
var collator = new Intl.Collator();
|
|
|
|
return collator.compare;
|
|
|
|
} catch (e) {
|
|
|
|
}
|
|
|
|
|
|
|
|
return function util_strcmp (a, b) {
|
|
|
|
return (a < b ? -1 : (a > b ? 1 : 0));
|
|
|
|
};
|
|
|
|
}());
|
|
|
|
|
2013-07-05 17:43:56 +02:00
|
|
|
exports.escape_regexp = function (string) {
|
2013-07-01 23:51:03 +02:00
|
|
|
// code from https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions
|
|
|
|
// Modified to escape the ^ to appease jslint. :/
|
|
|
|
return string.replace(/([.*+?\^=!:${}()|\[\]\/\\])/g, "\\$1");
|
|
|
|
};
|
|
|
|
|
2013-05-07 19:07:05 +02:00
|
|
|
exports.array_compare = function util_array_compare(a, b) {
|
|
|
|
if (a.length !== b.length) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
var i;
|
|
|
|
for (i = 0; i < a.length; ++i) {
|
|
|
|
if (a[i] !== b[i]) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
};
|
|
|
|
|
2013-08-06 21:34:43 +02:00
|
|
|
/* Represents a value that is expensive to compute and should be
|
|
|
|
* computed on demand and then cached. The value can be forcefully
|
|
|
|
* recalculated on the next call to get() by calling reset().
|
|
|
|
*
|
|
|
|
* You must supply a option to the constructor called compute_value
|
|
|
|
* which should be a function that computes the uncached value.
|
|
|
|
*/
|
|
|
|
var unassigned_value_sentinel = {};
|
|
|
|
exports.CachedValue = function (opts) {
|
|
|
|
this._value = unassigned_value_sentinel;
|
|
|
|
_.extend(this, opts);
|
|
|
|
};
|
|
|
|
|
|
|
|
exports.CachedValue.prototype = {
|
|
|
|
get: function CachedValue_get() {
|
|
|
|
if (this._value === unassigned_value_sentinel) {
|
|
|
|
this._value = this.compute_value();
|
|
|
|
}
|
|
|
|
return this._value;
|
|
|
|
},
|
|
|
|
|
|
|
|
reset: function CachedValue_reset() {
|
|
|
|
this._value = unassigned_value_sentinel;
|
|
|
|
}
|
|
|
|
};
|
2013-07-11 23:42:44 +02:00
|
|
|
|
2013-08-08 20:22:33 +02:00
|
|
|
exports.enforce_arity = function util_enforce_arity(func) {
|
|
|
|
return function () {
|
|
|
|
if (func.length !== arguments.length) {
|
|
|
|
throw new Error("Function '" + func.name + "' called with "
|
|
|
|
+ arguments.length + " arguments, but expected "
|
|
|
|
+ func.length);
|
|
|
|
}
|
|
|
|
return func.apply(this, arguments);
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|
2014-03-07 00:44:15 +01:00
|
|
|
exports.execute_early = function (func) {
|
|
|
|
if (page_params.test_suite) {
|
|
|
|
$(document).one('phantom_page_loaded', func);
|
|
|
|
} else {
|
|
|
|
$(func);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2012-11-30 18:33:32 +01:00
|
|
|
return exports;
|
|
|
|
}());
|
2013-08-06 19:06:45 +02:00
|
|
|
if (typeof module !== 'undefined') {
|
|
|
|
module.exports = util;
|
|
|
|
}
|