[tryton-debian-vcs] debian.tryton.org branch master updated. 2e319be9e121dcfcadf941ba6a5d0b4af08b2509
git repository hosting
tryton-debian-vcs at m9s.biz
Thu Nov 21 17:28:51 UTC 2013
The following commit has been merged in the master branch:
http://debian.tryton.org/gitweb/?p=packages/debian.tryton.org.git;a=commitdiff;h=2e319be9e121dcfcadf941ba6a5d0b4af08b2509
commit 2e319be9e121dcfcadf941ba6a5d0b4af08b2509
Author: Mathias Behrle <mathiasb at m9s.biz>
Date: Thu Nov 21 18:28:33 2013 +0100
Updating for new version 3.0.
diff --git a/doc/build/doctrees/environment.pickle b/doc/build/doctrees/environment.pickle
index 57605e9..e4719de 100644
Binary files a/doc/build/doctrees/environment.pickle and b/doc/build/doctrees/environment.pickle differ
diff --git a/doc/build/doctrees/mirror.doctree b/doc/build/doctrees/mirror.doctree
index afcb35c..62feac3 100644
Binary files a/doc/build/doctrees/mirror.doctree and b/doc/build/doctrees/mirror.doctree differ
diff --git a/doc/build/html/_sources/mirror.txt b/doc/build/html/_sources/mirror.txt
index a03fae1..5a2e6bf 100644
--- a/doc/build/html/_sources/mirror.txt
+++ b/doc/build/html/_sources/mirror.txt
@@ -25,7 +25,7 @@ e.g. wheezy-2.2, wheezy-2.6, etc.
Packages suitable for testing and unstable are available under the distribution <Debian-Future-Release>-<Tryton-Version>
-e.g. at the time of writing jessie-2.6, jessie-2.8, etc.
+e.g. at the time of writing jessie-2.6, jessie-2.8, jessie-3.0 etc.
Available Distributions can be found at
@@ -74,6 +74,13 @@ There are ready-to-use source list files. They can be downloaded and saved direc
# cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-wheezy-2.8.list
+*Distribution wheezy-3.0*
+
+::
+
+ # cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-wheezy-3.0.list
+
+*
*Distribution jessie-2.2*
::
@@ -93,6 +100,12 @@ There are ready-to-use source list files. They can be downloaded and saved direc
# cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-2.8.list
+*Distribution jessie-3.0*
+
+::
+
+ # cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-3.0.list
+
Installation
diff --git a/doc/build/html/_static/jquery.js b/doc/build/html/_static/jquery.js
index 96d660c..1258119 100644
--- a/doc/build/html/_static/jquery.js
+++ b/doc/build/html/_static/jquery.js
@@ -11,7 +11,7 @@
* Copyright 2011, The Dojo Foundation
* Released under the MIT, BSD, and GPL Licenses.
*
- * Date: Thu Nov 15 18:28:24 BRST 2012
+ * Date: Thu Aug 1 23:20:30 BRT 2013
*/
(function( window, undefined ) {
diff --git a/doc/build/html/_static/pygments.css b/doc/build/html/_static/pygments.css
index 1a14f2a..d79caa1 100644
--- a/doc/build/html/_static/pygments.css
+++ b/doc/build/html/_static/pygments.css
@@ -13,11 +13,11 @@
.highlight .gr { color: #FF0000 } /* Generic.Error */
.highlight .gh { color: #000080; font-weight: bold } /* Generic.Heading */
.highlight .gi { color: #00A000 } /* Generic.Inserted */
-.highlight .go { color: #303030 } /* Generic.Output */
+.highlight .go { color: #333333 } /* Generic.Output */
.highlight .gp { color: #c65d09; font-weight: bold } /* Generic.Prompt */
.highlight .gs { font-weight: bold } /* Generic.Strong */
.highlight .gu { color: #800080; font-weight: bold } /* Generic.Subheading */
-.highlight .gt { color: #0040D0 } /* Generic.Traceback */
+.highlight .gt { color: #0044DD } /* Generic.Traceback */
.highlight .kc { color: #007020; font-weight: bold } /* Keyword.Constant */
.highlight .kd { color: #007020; font-weight: bold } /* Keyword.Declaration */
.highlight .kn { color: #007020; font-weight: bold } /* Keyword.Namespace */
diff --git a/doc/build/html/_static/searchtools.js b/doc/build/html/_static/searchtools.js
index 663be4c..6018a1d 100644
--- a/doc/build/html/_static/searchtools.js
+++ b/doc/build/html/_static/searchtools.js
@@ -301,7 +301,7 @@ var Search = {
},
query : function(query) {
- var stopwords = ["and","then","into","it","as","are","in","if","for","no","there","their","was","is","be","to","that","but","they","not","such","with","by","a","on","these","of","will","this","near","the","or","at"];
+ var stopwords = ["a","and","are","as","at","be","but","by","for","if","in","into","is","it","near","no","not","of","on","or","such","that","the","their","then","there","these","they","this","to","was","will","with"];
// Stem the searchterms and add them to the correct list
var stemmer = new Stemmer();
diff --git a/doc/build/html/_static/underscore.js b/doc/build/html/_static/underscore.js
index eaba008..a12f0d9 100644
--- a/doc/build/html/_static/underscore.js
+++ b/doc/build/html/_static/underscore.js
@@ -1,10 +1,7 @@
-// Underscore.js 1.1.6
-// (c) 2011 Jeremy Ashkenas, DocumentCloud Inc.
-// Underscore is freely distributable under the MIT license.
-// Portions of Underscore are inspired or borrowed from Prototype,
-// Oliver Steele's Functional, and John Resig's Micro-Templating.
-// For all details and documentation:
-// http://documentcloud.github.com/underscore
+// Underscore.js 1.4.4
+// http://underscorejs.org
+// (c) 2009-2013 Jeremy Ashkenas, DocumentCloud Inc.
+// Underscore may be freely distributed under the MIT license.
(function() {
@@ -24,8 +21,9 @@
var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
// Create quick reference variables for speed access to core prototypes.
- var slice = ArrayProto.slice,
- unshift = ArrayProto.unshift,
+ var push = ArrayProto.push,
+ slice = ArrayProto.slice,
+ concat = ArrayProto.concat,
toString = ObjProto.toString,
hasOwnProperty = ObjProto.hasOwnProperty;
@@ -46,38 +44,45 @@
nativeBind = FuncProto.bind;
// Create a safe reference to the Underscore object for use below.
- var _ = function(obj) { return new wrapper(obj); };
-
- // Export the Underscore object for **CommonJS**, with backwards-compatibility
- // for the old `require()` API. If we're not in CommonJS, add `_` to the
- // global object.
- if (typeof module !== 'undefined' && module.exports) {
- module.exports = _;
- _._ = _;
+ var _ = function(obj) {
+ if (obj instanceof _) return obj;
+ if (!(this instanceof _)) return new _(obj);
+ this._wrapped = obj;
+ };
+
+ // Export the Underscore object for **Node.js**, with
+ // backwards-compatibility for the old `require()` API. If we're in
+ // the browser, add `_` as a global object via a string identifier,
+ // for Closure Compiler "advanced" mode.
+ if (typeof exports !== 'undefined') {
+ if (typeof module !== 'undefined' && module.exports) {
+ exports = module.exports = _;
+ }
+ exports._ = _;
} else {
root._ = _;
}
// Current version.
- _.VERSION = '1.1.6';
+ _.VERSION = '1.4.4';
// Collection Functions
// --------------------
// The cornerstone, an `each` implementation, aka `forEach`.
- // Handles objects implementing `forEach`, arrays, and raw objects.
+ // Handles objects with the built-in `forEach`, arrays, and raw objects.
// Delegates to **ECMAScript 5**'s native `forEach` if available.
var each = _.each = _.forEach = function(obj, iterator, context) {
if (obj == null) return;
if (nativeForEach && obj.forEach === nativeForEach) {
obj.forEach(iterator, context);
- } else if (_.isNumber(obj.length)) {
+ } else if (obj.length === +obj.length) {
for (var i = 0, l = obj.length; i < l; i++) {
if (iterator.call(context, obj[i], i, obj) === breaker) return;
}
} else {
for (var key in obj) {
- if (hasOwnProperty.call(obj, key)) {
+ if (_.has(obj, key)) {
if (iterator.call(context, obj[key], key, obj) === breaker) return;
}
}
@@ -86,7 +91,7 @@
// Return the results of applying the iterator to each element.
// Delegates to **ECMAScript 5**'s native `map` if available.
- _.map = function(obj, iterator, context) {
+ _.map = _.collect = function(obj, iterator, context) {
var results = [];
if (obj == null) return results;
if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context);
@@ -96,37 +101,54 @@
return results;
};
+ var reduceError = 'Reduce of empty array with no initial value';
+
// **Reduce** builds up a single result from a list of values, aka `inject`,
// or `foldl`. Delegates to **ECMAScript 5**'s native `reduce` if available.
_.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) {
- var initial = memo !== void 0;
+ var initial = arguments.length > 2;
if (obj == null) obj = [];
if (nativeReduce && obj.reduce === nativeReduce) {
if (context) iterator = _.bind(iterator, context);
return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator);
}
each(obj, function(value, index, list) {
- if (!initial && index === 0) {
+ if (!initial) {
memo = value;
initial = true;
} else {
memo = iterator.call(context, memo, value, index, list);
}
});
- if (!initial) throw new TypeError("Reduce of empty array with no initial value");
+ if (!initial) throw new TypeError(reduceError);
return memo;
};
// The right-associative version of reduce, also known as `foldr`.
// Delegates to **ECMAScript 5**'s native `reduceRight` if available.
_.reduceRight = _.foldr = function(obj, iterator, memo, context) {
+ var initial = arguments.length > 2;
if (obj == null) obj = [];
if (nativeReduceRight && obj.reduceRight === nativeReduceRight) {
if (context) iterator = _.bind(iterator, context);
- return memo !== void 0 ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator);
+ return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator);
+ }
+ var length = obj.length;
+ if (length !== +length) {
+ var keys = _.keys(obj);
+ length = keys.length;
}
- var reversed = (_.isArray(obj) ? obj.slice() : _.toArray(obj)).reverse();
- return _.reduce(reversed, iterator, memo, context);
+ each(obj, function(value, index, list) {
+ index = keys ? keys[--length] : --length;
+ if (!initial) {
+ memo = obj[index];
+ initial = true;
+ } else {
+ memo = iterator.call(context, memo, obj[index], index, list);
+ }
+ });
+ if (!initial) throw new TypeError(reduceError);
+ return memo;
};
// Return the first value which passes a truth test. Aliased as `detect`.
@@ -156,25 +178,23 @@
// Return all the elements for which a truth test fails.
_.reject = function(obj, iterator, context) {
- var results = [];
- if (obj == null) return results;
- each(obj, function(value, index, list) {
- if (!iterator.call(context, value, index, list)) results[results.length] = value;
- });
- return results;
+ return _.filter(obj, function(value, index, list) {
+ return !iterator.call(context, value, index, list);
+ }, context);
};
// Determine whether all of the elements match a truth test.
// Delegates to **ECMAScript 5**'s native `every` if available.
// Aliased as `all`.
_.every = _.all = function(obj, iterator, context) {
+ iterator || (iterator = _.identity);
var result = true;
if (obj == null) return result;
if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context);
each(obj, function(value, index, list) {
if (!(result = result && iterator.call(context, value, index, list))) return breaker;
});
- return result;
+ return !!result;
};
// Determine if at least one element in the object matches a truth test.
@@ -186,28 +206,27 @@
if (obj == null) return result;
if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context);
each(obj, function(value, index, list) {
- if (result = iterator.call(context, value, index, list)) return breaker;
+ if (result || (result = iterator.call(context, value, index, list))) return breaker;
});
- return result;
+ return !!result;
};
- // Determine if a given value is included in the array or object using `===`.
- // Aliased as `contains`.
- _.include = _.contains = function(obj, target) {
- var found = false;
- if (obj == null) return found;
+ // Determine if the array or object contains a given value (using `===`).
+ // Aliased as `include`.
+ _.contains = _.include = function(obj, target) {
+ if (obj == null) return false;
if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1;
- any(obj, function(value) {
- if (found = value === target) return true;
+ return any(obj, function(value) {
+ return value === target;
});
- return found;
};
// Invoke a method (with arguments) on every item in a collection.
_.invoke = function(obj, method) {
var args = slice.call(arguments, 2);
+ var isFunc = _.isFunction(method);
return _.map(obj, function(value) {
- return (method.call ? method || value : value[method]).apply(value, args);
+ return (isFunc ? method : value[method]).apply(value, args);
});
};
@@ -216,10 +235,33 @@
return _.map(obj, function(value){ return value[key]; });
};
+ // Convenience version of a common use case of `filter`: selecting only objects
+ // containing specific `key:value` pairs.
+ _.where = function(obj, attrs, first) {
+ if (_.isEmpty(attrs)) return first ? null : [];
+ return _[first ? 'find' : 'filter'](obj, function(value) {
+ for (var key in attrs) {
+ if (attrs[key] !== value[key]) return false;
+ }
+ return true;
+ });
+ };
+
+ // Convenience version of a common use case of `find`: getting the first object
+ // containing specific `key:value` pairs.
+ _.findWhere = function(obj, attrs) {
+ return _.where(obj, attrs, true);
+ };
+
// Return the maximum element or (element-based computation).
+ // Can't optimize arrays of integers longer than 65,535 elements.
+ // See: https://bugs.webkit.org/show_bug.cgi?id=80797
_.max = function(obj, iterator, context) {
- if (!iterator && _.isArray(obj)) return Math.max.apply(Math, obj);
- var result = {computed : -Infinity};
+ if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
+ return Math.max.apply(Math, obj);
+ }
+ if (!iterator && _.isEmpty(obj)) return -Infinity;
+ var result = {computed : -Infinity, value: -Infinity};
each(obj, function(value, index, list) {
var computed = iterator ? iterator.call(context, value, index, list) : value;
computed >= result.computed && (result = {value : value, computed : computed});
@@ -229,8 +271,11 @@
// Return the minimum element (or element-based computation).
_.min = function(obj, iterator, context) {
- if (!iterator && _.isArray(obj)) return Math.min.apply(Math, obj);
- var result = {computed : Infinity};
+ if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
+ return Math.min.apply(Math, obj);
+ }
+ if (!iterator && _.isEmpty(obj)) return Infinity;
+ var result = {computed : Infinity, value: Infinity};
each(obj, function(value, index, list) {
var computed = iterator ? iterator.call(context, value, index, list) : value;
computed < result.computed && (result = {value : value, computed : computed});
@@ -238,101 +283,195 @@
return result.value;
};
+ // Shuffle an array.
+ _.shuffle = function(obj) {
+ var rand;
+ var index = 0;
+ var shuffled = [];
+ each(obj, function(value) {
+ rand = _.random(index++);
+ shuffled[index - 1] = shuffled[rand];
+ shuffled[rand] = value;
+ });
+ return shuffled;
+ };
+
+ // An internal function to generate lookup iterators.
+ var lookupIterator = function(value) {
+ return _.isFunction(value) ? value : function(obj){ return obj[value]; };
+ };
+
// Sort the object's values by a criterion produced by an iterator.
- _.sortBy = function(obj, iterator, context) {
+ _.sortBy = function(obj, value, context) {
+ var iterator = lookupIterator(value);
return _.pluck(_.map(obj, function(value, index, list) {
return {
value : value,
+ index : index,
criteria : iterator.call(context, value, index, list)
};
}).sort(function(left, right) {
- var a = left.criteria, b = right.criteria;
- return a < b ? -1 : a > b ? 1 : 0;
+ var a = left.criteria;
+ var b = right.criteria;
+ if (a !== b) {
+ if (a > b || a === void 0) return 1;
+ if (a < b || b === void 0) return -1;
+ }
+ return left.index < right.index ? -1 : 1;
}), 'value');
};
- // Use a comparator function to figure out at what index an object should
- // be inserted so as to maintain order. Uses binary search.
- _.sortedIndex = function(array, obj, iterator) {
- iterator || (iterator = _.identity);
+ // An internal function used for aggregate "group by" operations.
+ var group = function(obj, value, context, behavior) {
+ var result = {};
+ var iterator = lookupIterator(value || _.identity);
+ each(obj, function(value, index) {
+ var key = iterator.call(context, value, index, obj);
+ behavior(result, key, value);
+ });
+ return result;
+ };
+
+ // Groups the object's values by a criterion. Pass either a string attribute
+ // to group by, or a function that returns the criterion.
+ _.groupBy = function(obj, value, context) {
+ return group(obj, value, context, function(result, key, value) {
+ (_.has(result, key) ? result[key] : (result[key] = [])).push(value);
+ });
+ };
+
+ // Counts instances of an object that group by a certain criterion. Pass
+ // either a string attribute to count by, or a function that returns the
+ // criterion.
+ _.countBy = function(obj, value, context) {
+ return group(obj, value, context, function(result, key) {
+ if (!_.has(result, key)) result[key] = 0;
+ result[key]++;
+ });
+ };
+
+ // Use a comparator function to figure out the smallest index at which
+ // an object should be inserted so as to maintain order. Uses binary search.
+ _.sortedIndex = function(array, obj, iterator, context) {
+ iterator = iterator == null ? _.identity : lookupIterator(iterator);
+ var value = iterator.call(context, obj);
var low = 0, high = array.length;
while (low < high) {
- var mid = (low + high) >> 1;
- iterator(array[mid]) < iterator(obj) ? low = mid + 1 : high = mid;
+ var mid = (low + high) >>> 1;
+ iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid;
}
return low;
};
// Safely convert anything iterable into a real, live array.
- _.toArray = function(iterable) {
- if (!iterable) return [];
- if (iterable.toArray) return iterable.toArray();
- if (_.isArray(iterable)) return iterable;
- if (_.isArguments(iterable)) return slice.call(iterable);
- return _.values(iterable);
+ _.toArray = function(obj) {
+ if (!obj) return [];
+ if (_.isArray(obj)) return slice.call(obj);
+ if (obj.length === +obj.length) return _.map(obj, _.identity);
+ return _.values(obj);
};
// Return the number of elements in an object.
_.size = function(obj) {
- return _.toArray(obj).length;
+ if (obj == null) return 0;
+ return (obj.length === +obj.length) ? obj.length : _.keys(obj).length;
};
// Array Functions
// ---------------
// Get the first element of an array. Passing **n** will return the first N
- // values in the array. Aliased as `head`. The **guard** check allows it to work
- // with `_.map`.
- _.first = _.head = function(array, n, guard) {
+ // values in the array. Aliased as `head` and `take`. The **guard** check
+ // allows it to work with `_.map`.
+ _.first = _.head = _.take = function(array, n, guard) {
+ if (array == null) return void 0;
return (n != null) && !guard ? slice.call(array, 0, n) : array[0];
};
- // Returns everything but the first entry of the array. Aliased as `tail`.
- // Especially useful on the arguments object. Passing an **index** will return
- // the rest of the values in the array from that index onward. The **guard**
- // check allows it to work with `_.map`.
- _.rest = _.tail = function(array, index, guard) {
- return slice.call(array, (index == null) || guard ? 1 : index);
+ // Returns everything but the last entry of the array. Especially useful on
+ // the arguments object. Passing **n** will return all the values in
+ // the array, excluding the last N. The **guard** check allows it to work with
+ // `_.map`.
+ _.initial = function(array, n, guard) {
+ return slice.call(array, 0, array.length - ((n == null) || guard ? 1 : n));
+ };
+
+ // Get the last element of an array. Passing **n** will return the last N
+ // values in the array. The **guard** check allows it to work with `_.map`.
+ _.last = function(array, n, guard) {
+ if (array == null) return void 0;
+ if ((n != null) && !guard) {
+ return slice.call(array, Math.max(array.length - n, 0));
+ } else {
+ return array[array.length - 1];
+ }
};
- // Get the last element of an array.
- _.last = function(array) {
- return array[array.length - 1];
+ // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
+ // Especially useful on the arguments object. Passing an **n** will return
+ // the rest N values in the array. The **guard**
+ // check allows it to work with `_.map`.
+ _.rest = _.tail = _.drop = function(array, n, guard) {
+ return slice.call(array, (n == null) || guard ? 1 : n);
};
// Trim out all falsy values from an array.
_.compact = function(array) {
- return _.filter(array, function(value){ return !!value; });
+ return _.filter(array, _.identity);
+ };
+
+ // Internal implementation of a recursive `flatten` function.
+ var flatten = function(input, shallow, output) {
+ each(input, function(value) {
+ if (_.isArray(value)) {
+ shallow ? push.apply(output, value) : flatten(value, shallow, output);
+ } else {
+ output.push(value);
+ }
+ });
+ return output;
};
// Return a completely flattened version of an array.
- _.flatten = function(array) {
- return _.reduce(array, function(memo, value) {
- if (_.isArray(value)) return memo.concat(_.flatten(value));
- memo[memo.length] = value;
- return memo;
- }, []);
+ _.flatten = function(array, shallow) {
+ return flatten(array, shallow, []);
};
// Return a version of the array that does not contain the specified value(s).
_.without = function(array) {
- var values = slice.call(arguments, 1);
- return _.filter(array, function(value){ return !_.include(values, value); });
+ return _.difference(array, slice.call(arguments, 1));
};
// Produce a duplicate-free version of the array. If the array has already
// been sorted, you have the option of using a faster algorithm.
// Aliased as `unique`.
- _.uniq = _.unique = function(array, isSorted) {
- return _.reduce(array, function(memo, el, i) {
- if (0 == i || (isSorted === true ? _.last(memo) != el : !_.include(memo, el))) memo[memo.length] = el;
- return memo;
- }, []);
+ _.uniq = _.unique = function(array, isSorted, iterator, context) {
+ if (_.isFunction(isSorted)) {
+ context = iterator;
+ iterator = isSorted;
+ isSorted = false;
+ }
+ var initial = iterator ? _.map(array, iterator, context) : array;
+ var results = [];
+ var seen = [];
+ each(initial, function(value, index) {
+ if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) {
+ seen.push(value);
+ results.push(array[index]);
+ }
+ });
+ return results;
+ };
+
+ // Produce an array that contains the union: each distinct element from all of
+ // the passed-in arrays.
+ _.union = function() {
+ return _.uniq(concat.apply(ArrayProto, arguments));
};
// Produce an array that contains every item shared between all the
// passed-in arrays.
- _.intersect = function(array) {
+ _.intersection = function(array) {
var rest = slice.call(arguments, 1);
return _.filter(_.uniq(array), function(item) {
return _.every(rest, function(other) {
@@ -341,16 +480,41 @@
});
};
+ // Take the difference between one array and a number of other arrays.
+ // Only the elements present in just the first array will remain.
+ _.difference = function(array) {
+ var rest = concat.apply(ArrayProto, slice.call(arguments, 1));
+ return _.filter(array, function(value){ return !_.contains(rest, value); });
+ };
+
// Zip together multiple lists into a single array -- elements that share
// an index go together.
_.zip = function() {
var args = slice.call(arguments);
var length = _.max(_.pluck(args, 'length'));
var results = new Array(length);
- for (var i = 0; i < length; i++) results[i] = _.pluck(args, "" + i);
+ for (var i = 0; i < length; i++) {
+ results[i] = _.pluck(args, "" + i);
+ }
return results;
};
+ // Converts lists into objects. Pass either a single array of `[key, value]`
+ // pairs, or two parallel arrays of the same length -- one of keys, and one of
+ // the corresponding values.
+ _.object = function(list, values) {
+ if (list == null) return {};
+ var result = {};
+ for (var i = 0, l = list.length; i < l; i++) {
+ if (values) {
+ result[list[i]] = values[i];
+ } else {
+ result[list[i][0]] = list[i][1];
+ }
+ }
+ return result;
+ };
+
// If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**),
// we need this function. Return the position of the first occurrence of an
// item in an array, or -1 if the item is not included in the array.
@@ -359,22 +523,28 @@
// for **isSorted** to use binary search.
_.indexOf = function(array, item, isSorted) {
if (array == null) return -1;
- var i, l;
+ var i = 0, l = array.length;
if (isSorted) {
- i = _.sortedIndex(array, item);
- return array[i] === item ? i : -1;
+ if (typeof isSorted == 'number') {
+ i = (isSorted < 0 ? Math.max(0, l + isSorted) : isSorted);
+ } else {
+ i = _.sortedIndex(array, item);
+ return array[i] === item ? i : -1;
+ }
}
- if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item);
- for (i = 0, l = array.length; i < l; i++) if (array[i] === item) return i;
+ if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted);
+ for (; i < l; i++) if (array[i] === item) return i;
return -1;
};
-
// Delegates to **ECMAScript 5**'s native `lastIndexOf` if available.
- _.lastIndexOf = function(array, item) {
+ _.lastIndexOf = function(array, item, from) {
if (array == null) return -1;
- if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) return array.lastIndexOf(item);
- var i = array.length;
+ var hasIndex = from != null;
+ if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) {
+ return hasIndex ? array.lastIndexOf(item, from) : array.lastIndexOf(item);
+ }
+ var i = (hasIndex ? from : array.length);
while (i--) if (array[i] === item) return i;
return -1;
};
@@ -405,14 +575,22 @@
// ------------------
// Create a function bound to a given object (assigning `this`, and arguments,
- // optionally). Binding with arguments is also known as `curry`.
- // Delegates to **ECMAScript 5**'s native `Function.bind` if available.
- // We check for `func.bind` first, to fail fast when `func` is undefined.
- _.bind = function(func, obj) {
+ // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
+ // available.
+ _.bind = function(func, context) {
if (func.bind === nativeBind && nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
var args = slice.call(arguments, 2);
return function() {
- return func.apply(obj, args.concat(slice.call(arguments)));
+ return func.apply(context, args.concat(slice.call(arguments)));
+ };
+ };
+
+ // Partially apply a function by creating a version that has had some of its
+ // arguments pre-filled, without changing its dynamic `this` context.
+ _.partial = function(func) {
+ var args = slice.call(arguments, 1);
+ return function() {
+ return func.apply(this, args.concat(slice.call(arguments)));
};
};
@@ -420,7 +598,7 @@
// all callbacks defined on an object belong to it.
_.bindAll = function(obj) {
var funcs = slice.call(arguments, 1);
- if (funcs.length == 0) funcs = _.functions(obj);
+ if (funcs.length === 0) funcs = _.functions(obj);
each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); });
return obj;
};
@@ -431,7 +609,7 @@
hasher || (hasher = _.identity);
return function() {
var key = hasher.apply(this, arguments);
- return hasOwnProperty.call(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));
+ return _.has(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));
};
};
@@ -439,7 +617,7 @@
// it with the arguments supplied.
_.delay = function(func, wait) {
var args = slice.call(arguments, 2);
- return setTimeout(function(){ return func.apply(func, args); }, wait);
+ return setTimeout(function(){ return func.apply(null, args); }, wait);
};
// Defers a function, scheduling it to run after the current call stack has
@@ -448,31 +626,51 @@
return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1)));
};
- // Internal function used to implement `_.throttle` and `_.debounce`.
- var limit = function(func, wait, debounce) {
- var timeout;
- return function() {
- var context = this, args = arguments;
- var throttler = function() {
- timeout = null;
- func.apply(context, args);
- };
- if (debounce) clearTimeout(timeout);
- if (debounce || !timeout) timeout = setTimeout(throttler, wait);
- };
- };
-
// Returns a function, that, when invoked, will only be triggered at most once
// during a given window of time.
_.throttle = function(func, wait) {
- return limit(func, wait, false);
+ var context, args, timeout, result;
+ var previous = 0;
+ var later = function() {
+ previous = new Date;
+ timeout = null;
+ result = func.apply(context, args);
+ };
+ return function() {
+ var now = new Date;
+ var remaining = wait - (now - previous);
+ context = this;
+ args = arguments;
+ if (remaining <= 0) {
+ clearTimeout(timeout);
+ timeout = null;
+ previous = now;
+ result = func.apply(context, args);
+ } else if (!timeout) {
+ timeout = setTimeout(later, remaining);
+ }
+ return result;
+ };
};
// Returns a function, that, as long as it continues to be invoked, will not
// be triggered. The function will be called after it stops being called for
- // N milliseconds.
- _.debounce = function(func, wait) {
- return limit(func, wait, true);
+ // N milliseconds. If `immediate` is passed, trigger the function on the
+ // leading edge, instead of the trailing.
+ _.debounce = function(func, wait, immediate) {
+ var timeout, result;
+ return function() {
+ var context = this, args = arguments;
+ var later = function() {
+ timeout = null;
+ if (!immediate) result = func.apply(context, args);
+ };
+ var callNow = immediate && !timeout;
+ clearTimeout(timeout);
+ timeout = setTimeout(later, wait);
+ if (callNow) result = func.apply(context, args);
+ return result;
+ };
};
// Returns a function that will be executed at most one time, no matter how
@@ -482,7 +680,9 @@
return function() {
if (ran) return memo;
ran = true;
- return memo = func.apply(this, arguments);
+ memo = func.apply(this, arguments);
+ func = null;
+ return memo;
};
};
@@ -491,7 +691,8 @@
// conditionally execute the original function.
_.wrap = function(func, wrapper) {
return function() {
- var args = [func].concat(slice.call(arguments));
+ var args = [func];
+ push.apply(args, arguments);
return wrapper.apply(this, args);
};
};
@@ -499,10 +700,10 @@
// Returns a function that is the composition of a list of functions, each
// consuming the return value of the function that follows.
_.compose = function() {
- var funcs = slice.call(arguments);
+ var funcs = arguments;
return function() {
- var args = slice.call(arguments);
- for (var i=funcs.length-1; i >= 0; i--) {
+ var args = arguments;
+ for (var i = funcs.length - 1; i >= 0; i--) {
args = [funcs[i].apply(this, args)];
}
return args[0];
@@ -511,12 +712,14 @@
// Returns a function that will only be executed after being called N times.
_.after = function(times, func) {
+ if (times <= 0) return func();
return function() {
- if (--times < 1) { return func.apply(this, arguments); }
+ if (--times < 1) {
+ return func.apply(this, arguments);
+ }
};
};
-
// Object Functions
// ----------------
@@ -525,36 +728,80 @@
_.keys = nativeKeys || function(obj) {
if (obj !== Object(obj)) throw new TypeError('Invalid object');
var keys = [];
- for (var key in obj) if (hasOwnProperty.call(obj, key)) keys[keys.length] = key;
+ for (var key in obj) if (_.has(obj, key)) keys[keys.length] = key;
return keys;
};
// Retrieve the values of an object's properties.
_.values = function(obj) {
- return _.map(obj, _.identity);
+ var values = [];
+ for (var key in obj) if (_.has(obj, key)) values.push(obj[key]);
+ return values;
+ };
+
+ // Convert an object into a list of `[key, value]` pairs.
+ _.pairs = function(obj) {
+ var pairs = [];
+ for (var key in obj) if (_.has(obj, key)) pairs.push([key, obj[key]]);
+ return pairs;
+ };
+
+ // Invert the keys and values of an object. The values must be serializable.
+ _.invert = function(obj) {
+ var result = {};
+ for (var key in obj) if (_.has(obj, key)) result[obj[key]] = key;
+ return result;
};
// Return a sorted list of the function names available on the object.
// Aliased as `methods`
_.functions = _.methods = function(obj) {
- return _.filter(_.keys(obj), function(key){ return _.isFunction(obj[key]); }).sort();
+ var names = [];
+ for (var key in obj) {
+ if (_.isFunction(obj[key])) names.push(key);
+ }
+ return names.sort();
};
// Extend a given object with all the properties in passed-in object(s).
_.extend = function(obj) {
each(slice.call(arguments, 1), function(source) {
- for (var prop in source) {
- if (source[prop] !== void 0) obj[prop] = source[prop];
+ if (source) {
+ for (var prop in source) {
+ obj[prop] = source[prop];
+ }
}
});
return obj;
};
+ // Return a copy of the object only containing the whitelisted properties.
+ _.pick = function(obj) {
+ var copy = {};
+ var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
+ each(keys, function(key) {
+ if (key in obj) copy[key] = obj[key];
+ });
+ return copy;
+ };
+
+ // Return a copy of the object without the blacklisted properties.
+ _.omit = function(obj) {
+ var copy = {};
+ var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
+ for (var key in obj) {
+ if (!_.contains(keys, key)) copy[key] = obj[key];
+ }
+ return copy;
+ };
+
// Fill in a given object with default properties.
_.defaults = function(obj) {
each(slice.call(arguments, 1), function(source) {
- for (var prop in source) {
- if (obj[prop] == null) obj[prop] = source[prop];
+ if (source) {
+ for (var prop in source) {
+ if (obj[prop] == null) obj[prop] = source[prop];
+ }
}
});
return obj;
@@ -562,6 +809,7 @@
// Create a (shallow-cloned) duplicate of an object.
_.clone = function(obj) {
+ if (!_.isObject(obj)) return obj;
return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
};
@@ -573,102 +821,162 @@
return obj;
};
+ // Internal recursive comparison function for `isEqual`.
+ var eq = function(a, b, aStack, bStack) {
+ // Identical objects are equal. `0 === -0`, but they aren't identical.
+ // See the Harmony `egal` proposal: http://wiki.ecmascript.org/doku.php?id=harmony:egal.
+ if (a === b) return a !== 0 || 1 / a == 1 / b;
+ // A strict comparison is necessary because `null == undefined`.
+ if (a == null || b == null) return a === b;
+ // Unwrap any wrapped objects.
+ if (a instanceof _) a = a._wrapped;
+ if (b instanceof _) b = b._wrapped;
+ // Compare `[[Class]]` names.
+ var className = toString.call(a);
+ if (className != toString.call(b)) return false;
+ switch (className) {
+ // Strings, numbers, dates, and booleans are compared by value.
+ case '[object String]':
+ // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
+ // equivalent to `new String("5")`.
+ return a == String(b);
+ case '[object Number]':
+ // `NaN`s are equivalent, but non-reflexive. An `egal` comparison is performed for
+ // other numeric values.
+ return a != +a ? b != +b : (a == 0 ? 1 / a == 1 / b : a == +b);
+ case '[object Date]':
+ case '[object Boolean]':
+ // Coerce dates and booleans to numeric primitive values. Dates are compared by their
+ // millisecond representations. Note that invalid dates with millisecond representations
+ // of `NaN` are not equivalent.
+ return +a == +b;
+ // RegExps are compared by their source patterns and flags.
+ case '[object RegExp]':
+ return a.source == b.source &&
+ a.global == b.global &&
+ a.multiline == b.multiline &&
+ a.ignoreCase == b.ignoreCase;
+ }
+ if (typeof a != 'object' || typeof b != 'object') return false;
+ // Assume equality for cyclic structures. The algorithm for detecting cyclic
+ // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
+ var length = aStack.length;
+ while (length--) {
+ // Linear search. Performance is inversely proportional to the number of
+ // unique nested structures.
+ if (aStack[length] == a) return bStack[length] == b;
+ }
+ // Add the first object to the stack of traversed objects.
+ aStack.push(a);
+ bStack.push(b);
+ var size = 0, result = true;
+ // Recursively compare objects and arrays.
+ if (className == '[object Array]') {
+ // Compare array lengths to determine if a deep comparison is necessary.
+ size = a.length;
+ result = size == b.length;
+ if (result) {
+ // Deep compare the contents, ignoring non-numeric properties.
+ while (size--) {
+ if (!(result = eq(a[size], b[size], aStack, bStack))) break;
+ }
+ }
+ } else {
+ // Objects with different constructors are not equivalent, but `Object`s
+ // from different frames are.
+ var aCtor = a.constructor, bCtor = b.constructor;
+ if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) &&
+ _.isFunction(bCtor) && (bCtor instanceof bCtor))) {
+ return false;
+ }
+ // Deep compare objects.
+ for (var key in a) {
+ if (_.has(a, key)) {
+ // Count the expected number of properties.
+ size++;
+ // Deep compare each member.
+ if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break;
+ }
+ }
+ // Ensure that both objects contain the same number of properties.
+ if (result) {
+ for (key in b) {
+ if (_.has(b, key) && !(size--)) break;
+ }
+ result = !size;
+ }
+ }
+ // Remove the first object from the stack of traversed objects.
+ aStack.pop();
+ bStack.pop();
+ return result;
+ };
+
// Perform a deep comparison to check if two objects are equal.
_.isEqual = function(a, b) {
- // Check object identity.
- if (a === b) return true;
- // Different types?
- var atype = typeof(a), btype = typeof(b);
- if (atype != btype) return false;
- // Basic equality test (watch out for coercions).
- if (a == b) return true;
- // One is falsy and the other truthy.
- if ((!a && b) || (a && !b)) return false;
- // Unwrap any wrapped objects.
- if (a._chain) a = a._wrapped;
- if (b._chain) b = b._wrapped;
- // One of them implements an isEqual()?
- if (a.isEqual) return a.isEqual(b);
- // Check dates' integer values.
- if (_.isDate(a) && _.isDate(b)) return a.getTime() === b.getTime();
- // Both are NaN?
- if (_.isNaN(a) && _.isNaN(b)) return false;
- // Compare regular expressions.
- if (_.isRegExp(a) && _.isRegExp(b))
- return a.source === b.source &&
- a.global === b.global &&
- a.ignoreCase === b.ignoreCase &&
- a.multiline === b.multiline;
- // If a is not an object by this point, we can't handle it.
- if (atype !== 'object') return false;
- // Check for different array lengths before comparing contents.
- if (a.length && (a.length !== b.length)) return false;
- // Nothing else worked, deep compare the contents.
- var aKeys = _.keys(a), bKeys = _.keys(b);
- // Different object sizes?
- if (aKeys.length != bKeys.length) return false;
- // Recursive comparison of contents.
- for (var key in a) if (!(key in b) || !_.isEqual(a[key], b[key])) return false;
- return true;
+ return eq(a, b, [], []);
};
- // Is a given array or object empty?
+ // Is a given array, string, or object empty?
+ // An "empty" object has no enumerable own-properties.
_.isEmpty = function(obj) {
+ if (obj == null) return true;
if (_.isArray(obj) || _.isString(obj)) return obj.length === 0;
- for (var key in obj) if (hasOwnProperty.call(obj, key)) return false;
+ for (var key in obj) if (_.has(obj, key)) return false;
return true;
};
// Is a given value a DOM element?
_.isElement = function(obj) {
- return !!(obj && obj.nodeType == 1);
+ return !!(obj && obj.nodeType === 1);
};
// Is a given value an array?
// Delegates to ECMA5's native Array.isArray
_.isArray = nativeIsArray || function(obj) {
- return toString.call(obj) === '[object Array]';
+ return toString.call(obj) == '[object Array]';
};
- // Is a given variable an arguments object?
- _.isArguments = function(obj) {
- return !!(obj && hasOwnProperty.call(obj, 'callee'));
+ // Is a given variable an object?
+ _.isObject = function(obj) {
+ return obj === Object(obj);
};
- // Is a given value a function?
- _.isFunction = function(obj) {
- return !!(obj && obj.constructor && obj.call && obj.apply);
- };
+ // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp.
+ each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) {
+ _['is' + name] = function(obj) {
+ return toString.call(obj) == '[object ' + name + ']';
+ };
+ });
- // Is a given value a string?
- _.isString = function(obj) {
- return !!(obj === '' || (obj && obj.charCodeAt && obj.substr));
- };
+ // Define a fallback version of the method in browsers (ahem, IE), where
+ // there isn't any inspectable "Arguments" type.
+ if (!_.isArguments(arguments)) {
+ _.isArguments = function(obj) {
+ return !!(obj && _.has(obj, 'callee'));
+ };
+ }
+
+ // Optimize `isFunction` if appropriate.
+ if (typeof (/./) !== 'function') {
+ _.isFunction = function(obj) {
+ return typeof obj === 'function';
+ };
+ }
- // Is a given value a number?
- _.isNumber = function(obj) {
- return !!(obj === 0 || (obj && obj.toExponential && obj.toFixed));
+ // Is a given object a finite number?
+ _.isFinite = function(obj) {
+ return isFinite(obj) && !isNaN(parseFloat(obj));
};
- // Is the given value `NaN`? `NaN` happens to be the only value in JavaScript
- // that does not equal itself.
+ // Is the given value `NaN`? (NaN is the only number which does not equal itself).
_.isNaN = function(obj) {
- return obj !== obj;
+ return _.isNumber(obj) && obj != +obj;
};
// Is a given value a boolean?
_.isBoolean = function(obj) {
- return obj === true || obj === false;
- };
-
- // Is a given value a date?
- _.isDate = function(obj) {
- return !!(obj && obj.getTimezoneOffset && obj.setUTCFullYear);
- };
-
- // Is the given value a regular expression?
- _.isRegExp = function(obj) {
- return !!(obj && obj.test && obj.exec && (obj.ignoreCase || obj.ignoreCase === false));
+ return obj === true || obj === false || toString.call(obj) == '[object Boolean]';
};
// Is a given value equal to null?
@@ -681,6 +989,12 @@
return obj === void 0;
};
+ // Shortcut function for checking if an object has a given property directly
+ // on itself (in other words, not on a prototype).
+ _.has = function(obj, key) {
+ return hasOwnProperty.call(obj, key);
+ };
+
// Utility Functions
// -----------------
@@ -697,15 +1011,67 @@
};
// Run a function **n** times.
- _.times = function (n, iterator, context) {
- for (var i = 0; i < n; i++) iterator.call(context, i);
+ _.times = function(n, iterator, context) {
+ var accum = Array(n);
+ for (var i = 0; i < n; i++) accum[i] = iterator.call(context, i);
+ return accum;
+ };
+
+ // Return a random integer between min and max (inclusive).
+ _.random = function(min, max) {
+ if (max == null) {
+ max = min;
+ min = 0;
+ }
+ return min + Math.floor(Math.random() * (max - min + 1));
+ };
+
+ // List of HTML entities for escaping.
+ var entityMap = {
+ escape: {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ "'": ''',
+ '/': '/'
+ }
+ };
+ entityMap.unescape = _.invert(entityMap.escape);
+
+ // Regexes containing the keys and values listed immediately above.
+ var entityRegexes = {
+ escape: new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'),
+ unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g')
+ };
+
+ // Functions for escaping and unescaping strings to/from HTML interpolation.
+ _.each(['escape', 'unescape'], function(method) {
+ _[method] = function(string) {
+ if (string == null) return '';
+ return ('' + string).replace(entityRegexes[method], function(match) {
+ return entityMap[method][match];
+ });
+ };
+ });
+
+ // If the value of the named property is a function then invoke it;
+ // otherwise, return it.
+ _.result = function(object, property) {
+ if (object == null) return null;
+ var value = object[property];
+ return _.isFunction(value) ? value.call(object) : value;
};
- // Add your own custom functions to the Underscore object, ensuring that
- // they're correctly added to the OOP wrapper as well.
+ // Add your own custom functions to the Underscore object.
_.mixin = function(obj) {
each(_.functions(obj), function(name){
- addToWrapper(name, _[name] = obj[name]);
+ var func = _[name] = obj[name];
+ _.prototype[name] = function() {
+ var args = [this._wrapped];
+ push.apply(args, arguments);
+ return result.call(this, func.apply(_, args));
+ };
});
};
@@ -713,7 +1079,7 @@
// Useful for temporary DOM ids.
var idCounter = 0;
_.uniqueId = function(prefix) {
- var id = idCounter++;
+ var id = ++idCounter + '';
return prefix ? prefix + id : id;
};
@@ -721,56 +1087,103 @@
// following template settings to use alternative delimiters.
_.templateSettings = {
evaluate : /<%([\s\S]+?)%>/g,
- interpolate : /<%=([\s\S]+?)%>/g
+ interpolate : /<%=([\s\S]+?)%>/g,
+ escape : /<%-([\s\S]+?)%>/g
+ };
+
+ // When customizing `templateSettings`, if you don't want to define an
+ // interpolation, evaluation or escaping regex, we need one that is
+ // guaranteed not to match.
+ var noMatch = /(.)^/;
+
+ // Certain characters need to be escaped so that they can be put into a
+ // string literal.
+ var escapes = {
+ "'": "'",
+ '\\': '\\',
+ '\r': 'r',
+ '\n': 'n',
+ '\t': 't',
+ '\u2028': 'u2028',
+ '\u2029': 'u2029'
};
+ var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g;
+
// JavaScript micro-templating, similar to John Resig's implementation.
// Underscore templating handles arbitrary delimiters, preserves whitespace,
// and correctly escapes quotes within interpolated code.
- _.template = function(str, data) {
- var c = _.templateSettings;
- var tmpl = 'var __p=[],print=function(){__p.push.apply(__p,arguments);};' +
- 'with(obj||{}){__p.push(\'' +
- str.replace(/\\/g, '\\\\')
- .replace(/'/g, "\\'")
- .replace(c.interpolate, function(match, code) {
- return "'," + code.replace(/\\'/g, "'") + ",'";
- })
- .replace(c.evaluate || null, function(match, code) {
- return "');" + code.replace(/\\'/g, "'")
- .replace(/[\r\n\t]/g, ' ') + "__p.push('";
- })
- .replace(/\r/g, '\\r')
- .replace(/\n/g, '\\n')
- .replace(/\t/g, '\\t')
- + "');}return __p.join('');";
- var func = new Function('obj', tmpl);
- return data ? func(data) : func;
- };
-
- // The OOP Wrapper
- // ---------------
+ _.template = function(text, data, settings) {
+ var render;
+ settings = _.defaults({}, settings, _.templateSettings);
+
+ // Combine delimiters into one regular expression via alternation.
+ var matcher = new RegExp([
+ (settings.escape || noMatch).source,
+ (settings.interpolate || noMatch).source,
+ (settings.evaluate || noMatch).source
+ ].join('|') + '|$', 'g');
+
+ // Compile the template source, escaping string literals appropriately.
+ var index = 0;
+ var source = "__p+='";
+ text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
+ source += text.slice(index, offset)
+ .replace(escaper, function(match) { return '\\' + escapes[match]; });
+
+ if (escape) {
+ source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
+ }
+ if (interpolate) {
+ source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
+ }
+ if (evaluate) {
+ source += "';\n" + evaluate + "\n__p+='";
+ }
+ index = offset + match.length;
+ return match;
+ });
+ source += "';\n";
+ // If a variable is not specified, place data values in local scope.
+ if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
+
+ source = "var __t,__p='',__j=Array.prototype.join," +
+ "print=function(){__p+=__j.call(arguments,'');};\n" +
+ source + "return __p;\n";
+
+ try {
+ render = new Function(settings.variable || 'obj', '_', source);
+ } catch (e) {
+ e.source = source;
+ throw e;
+ }
+
+ if (data) return render(data, _);
+ var template = function(data) {
+ return render.call(this, data, _);
+ };
+
+ // Provide the compiled function source as a convenience for precompilation.
+ template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}';
+
+ return template;
+ };
+
+ // Add a "chain" function, which will delegate to the wrapper.
+ _.chain = function(obj) {
+ return _(obj).chain();
+ };
+
+ // OOP
+ // ---------------
// If Underscore is called as a function, it returns a wrapped object that
// can be used OO-style. This wrapper holds altered versions of all the
// underscore functions. Wrapped objects may be chained.
- var wrapper = function(obj) { this._wrapped = obj; };
-
- // Expose `wrapper.prototype` as `_.prototype`
- _.prototype = wrapper.prototype;
// Helper function to continue chaining intermediate results.
- var result = function(obj, chain) {
- return chain ? _(obj).chain() : obj;
- };
-
- // A method to easily add functions to the OOP wrapper.
- var addToWrapper = function(name, func) {
- wrapper.prototype[name] = function() {
- var args = slice.call(arguments);
- unshift.call(args, this._wrapped);
- return result(func.apply(_, args), this._chain);
- };
+ var result = function(obj) {
+ return this._chain ? _(obj).chain() : obj;
};
// Add all of the Underscore functions to the wrapper object.
@@ -779,29 +1192,35 @@
// Add all mutator Array functions to the wrapper.
each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
var method = ArrayProto[name];
- wrapper.prototype[name] = function() {
- method.apply(this._wrapped, arguments);
- return result(this._wrapped, this._chain);
+ _.prototype[name] = function() {
+ var obj = this._wrapped;
+ method.apply(obj, arguments);
+ if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0];
+ return result.call(this, obj);
};
});
// Add all accessor Array functions to the wrapper.
each(['concat', 'join', 'slice'], function(name) {
var method = ArrayProto[name];
- wrapper.prototype[name] = function() {
- return result(method.apply(this._wrapped, arguments), this._chain);
+ _.prototype[name] = function() {
+ return result.call(this, method.apply(this._wrapped, arguments));
};
});
- // Start chaining a wrapped Underscore object.
- wrapper.prototype.chain = function() {
- this._chain = true;
- return this;
- };
+ _.extend(_.prototype, {
- // Extracts the result from a wrapped and chained object.
- wrapper.prototype.value = function() {
- return this._wrapped;
- };
+ // Start chaining a wrapped Underscore object.
+ chain: function() {
+ this._chain = true;
+ return this;
+ },
+
+ // Extracts the result from a wrapped and chained object.
+ value: function() {
+ return this._wrapped;
+ }
+
+ });
-})();
+}).call(this);
diff --git a/doc/build/html/mirror.html b/doc/build/html/mirror.html
index ccdf225..f3202fc 100644
--- a/doc/build/html/mirror.html
+++ b/doc/build/html/mirror.html
@@ -64,7 +64,7 @@ Those packages are unofficial and you are using them at your own risk (as always
<p>Naming convention for distributions is <Debian-Release>-<Tryton-Version></p>
<p>e.g. wheezy-2.2, wheezy-2.6, etc.</p>
<p>Packages suitable for testing and unstable are available under the distribution <Debian-Future-Release>-<Tryton-Version></p>
-<p>e.g. at the time of writing jessie-2.6, jessie-2.8, etc.</p>
+<p>e.g. at the time of writing jessie-2.6, jessie-2.8, jessie-3.0 etc.</p>
<p>Available Distributions can be found at</p>
<div class="highlight-python"><pre>http://debian.tryton.org/debian/dists/</pre>
</div>
@@ -94,6 +94,13 @@ Those packages are unofficial and you are using them at your own risk (as always
<div class="highlight-python"><div class="highlight"><pre><span class="c"># cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-wheezy-2.8.list</span>
</pre></div>
</div>
+<p><em>Distribution wheezy-3.0</em></p>
+<div class="highlight-python"><div class="highlight"><pre><span class="c"># cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-wheezy-3.0.list</span>
+</pre></div>
+</div>
+<ul class="simple">
+<li></li>
+</ul>
<p><em>Distribution jessie-2.2</em></p>
<div class="highlight-python"><div class="highlight"><pre><span class="c"># cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-2.2.list</span>
</pre></div>
@@ -106,6 +113,10 @@ Those packages are unofficial and you are using them at your own risk (as always
<div class="highlight-python"><div class="highlight"><pre><span class="c"># cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-2.8.list</span>
</pre></div>
</div>
+<p><em>Distribution jessie-3.0</em></p>
+<div class="highlight-python"><div class="highlight"><pre><span class="c"># cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-3.0.list</span>
+</pre></div>
+</div>
</div>
</div>
<div class="section" id="installation">
diff --git a/doc/build/html/objects.inv b/doc/build/html/objects.inv
index b2f1a28..04e2b03 100644
--- a/doc/build/html/objects.inv
+++ b/doc/build/html/objects.inv
@@ -2,5 +2,5 @@
# Project: debian.tryton.org
# Version: 1.0
# The remainder of this file is compressed using zlib.
-xÚmPMk1½çWì5¯½¼¤
-=ÊhÒv6³$#Ûý÷uwi¤·¼ÏðÆ»¢u?:³}C8;Ôf}a_¯ÜãJÌo…0ÑŸŒO‹õEo¤0Ä.·Þ…zØf FJÝ7ÒظtàCô§ª×Ô¾*ú«(ª'ûÏ€a2U(vdoèÊ”ì ]®mD¸â>ˆaÞ)NSÔÖD
ëäÊ)MmE R¢$’2’2÷”ù“:JåF*ßï•ŸQõpžˆ!óÓ ‹´(òMaŒ˜w%º‘²4F$°mGeëM7«_-_»Ô
\ No newline at end of file
+xÚmAkÃ0 …ïþ†õê®»z)´PºÁŽE=WD±‚í’å߯‰ì҄ݬ÷¾÷ì]À`ݯNÙ~\ ió®}Q×·ÜÒ›ÞoE0ð=/@ÌgÑ]éý4)ÂФ9;IOl Tϱù!îç`×<®~M «£¿‹£Z¶ÿ Ð
¦å†Û;¹rJr¯·yD´B
+pï”å>ƒãU«mˬZ@7$LyñÅš ÉÅ|(Ñý8© ‡ÌA[wAº¬£ë8aæ8,z1FŽÒ()#)óH™—Ô—Tn¥ró¨<=Mõ=_»Ô
\ No newline at end of file
diff --git a/doc/build/html/searchindex.js b/doc/build/html/searchindex.js
index 3e1a646..831be08 100644
--- a/doc/build/html/searchindex.js
+++ b/doc/build/html/searchindex.js
@@ -1 +1 @@
-Search.setIndex({objects:{},terms:{scm:2,adminstr:[],dist:5,angezeigt:[],all:[6,1,4,5],selbst:[],zertifkatsverwaltung:[],follow:[4,5],"skriptf\u00e4hig":[],auf:[1,3],berechtigung:[],entsprechend:1,intermedi:2,articl:[],under:5,sourc:[0,5],everi:5,risk:5,fals:[],neue:1,aktualisierung:[],verschiedenen:3,upstream:[1,3],zertifkat:[],brows:0,probeinstal:1,administr:[],die:[1,3],list:[0,4,5],upload:4,"try":5,path:6,der:[1,3],dir:1,download:[6,0,5,1],index:0,what:2,konfigur:[],sub:3,access:[6,0],version:[1,2,5],mittlerweil:1,"new":5,method:[],dem:[1,3],erstellen:1,ggf:1,layout:3,sind:3,keydir:[],deb:5,asc:5,search:0,hgnest:[],mitgeforkt:3,ersten:1,cert:[],lokal:[],durch:[],pick:[1,2],via:[6,4,5],modul:[0,5],prefer:5,gitolit:[0,2,1],apt:[6,0,5,1],wir:1,instal:[6,0,5,1],txt:6,jedenfal:1,from:[2,5],commun:4,pref:5,regist:6,upgrad:5,sieh:1,usr:1,kurzanleitung:1,reconfigur:[],"gegenw\u00e4rtig":[],aufbau:3,stick:5,muss:3,must:6,reinkopieren:1,none:[],entfernen:[],setup:2,work:5,cat:[],can:[6,5]
,den:[1,3],simpel:[],purpos:6,root:[],control:2,mrtrust:6,tar:[1,3],systemweit:[],share:1,indic:0,tag:1,want:5,tarbal:1,installier:1,pushen:1,alwai:5,chroot:1,multipl:2,geforkt:3,"k\u00f6nnen":3,how:2,kompress:1,sid:2,verifi:[],simpl:2,berechtigungen:[],abbilden:3,clone:[6,1],"zus\u00e4tzlich":3,zugang:[],"\u00e4nderungen":1,mai:5,usus:5,man:6,versehen:3,util:[],github:2,freigeschaltet:[],unterhalb:1,stackoverflow:2,help:2,quellen:[],entsprechen:[],doku:1,sitaramc:[],netz:[],unoffici:5,committen:1,sic:1,polici:5,vth:3,fix:5,mail:[0,4],main:5,them:5,good:6,gitweb:[6,0,2],"m\u00fcssen":[],python:1,auth:[],paketlisten:[],wenn:1,gitstat:[],document:2,name:[1,5],changelog:1,anpassen:1,kombin:[],package_nam:6,each:6,found:[6,5],usernamen:[],sshuttl:[0,1,2,3,4,5,6],kann:[],replac:5,individu:2,"2vth":3,backport:[5,3],special:[0,2],out:2,"\u00fcberschrieben":[],gesamten:[],internen:3,content:[],werden:3,daniel:2,suitabl:5,workflow:[1,2,3],pub:[],tryton:[0,1,2,3,4,5,6],mkd:[],releas:[1,5,3],o
rg:[0,1,2,3,4,5,6],progit:[],allerd:[],exportieren:[],ist:1,thing:4,schemata:5,deshalb:1,imposs:5,pristin:[1,3],softwar:2,einer:[],directli:5,nach:[1,3],number:5,echo:[6,5],hook:[],ihn:[],"f\u00fcr":[1,3],prioriti:5,differ:5,gitreadi:2,convent:5,mkdir:[],system:2,messag:4,master:2,setzen:[],multirepositori:6,toc:2,nutzen:[],schema:5,tool:6,lighttpd:[],paket:1,conserv:5,dpkg:[],"3_distributed_workflow":2,bei:1,remot:2,tree:[6,0],project:[],dann:1,browser:[],pro:3,packag:[6,0,5,2,1],tabl:0,einpflegen:1,reposnam:1,"sp\u00e4ter":[],note:5,also:6,gepusht:3,prepar:1,distribut:[0,2,5],usernam:[],dateiendung:1,bzw:1,url:6,doc:1,paketen:1,zertifikat:[],clean:1,cheat:[0,2],hostnam:[],eigen:1,locat:2,acquir:[],configur:6,experiment:1,hinterlegen:[],installieren:[],over:5,"ben\u00f6tigt":3,erstellung:[],get:[6,1,5],pave:[],repo:[1,3],ssl:[],ssh:[0,1,2,3,4,5,6],wheezi:[5,3],einbindung:[],crt:[],"public":[],provid:5,stuff:[1,2],integr:[],freigegebenen:[],summari:6,wiki:2,certif:[],ubunt:2,nur:3,n
un:3,packen:1,fail:2,einfach:[],sammelverwaltung:[],wird:3,dauerhaft:[],"8vth":3,weiter:3,erledigt:[],listinfo:4,progress:2,signatur:5,kei:[6,5],einzelrepo:[],"ausw\u00e4hlen":[],admin:1,etc:[4,5],nicht:3,und:[1,3],trytond:1,com:2,overview:[0,4],linux:2,respect:5,guid:2,orig:1,mailman:4,pin:[0,5],oder:[],due:5,erscheinen:3,basic:[1,5,3],distributionen:[],create_mrconfig:6,those:5,"\u00fcber":[],therefor:5,look:5,amend:1,jessi:5,anonym:[6,0],ein:3,"\u00e4ndert":1,protcol:6,readi:5,vom:[],von:1,ansonsten:1,archiv:[4,5],conf:[],"\u00e4ndern":[],vorgenommen:[],zusatz:3,develop:[6,0,4],thei:5,make:5,lintian:1,html:[1,2],aptabl:5,"\u00e4quival":[],incl:5,complet:[6,0],benutzten:[],http:[0,1,2,3,4,5,6],webserv:[],moment:5,user:[],reposerstellung:[],aktualisieren:[],client:5,thi:[6,5],"\u00f6ffentlich":3,einbinden:[],eigenen:[],klonen:1,"funktionalit\u00e4t":[],web:[],typisch:3,add:[1,5],other:5,"n\u00e4chstem":[],blob:[],cherri:1,save:5,futur:5,debian_repo:[],unter:1,read:4,voraussetzung:[
],passwort:[],neuem:1,biz:[],server_2:1,anpassungen:1,rogerdudl:2,password:[],you:5,daemon:2,like:5,specif:2,mit:[1,3],unstabl:5,updat:[6,0,5],manag:2,eben:1,sollen:3,eintragen:1,cdwilson:2,intern:3,sampl:5,authent:[6,0],umbenennen:[],home:[],server:[6,1,5],transport:[],rsync:[],einsehbar:[],zugriff:[],per:3,pem:[],errtheblog:2,benannt:3,gebrauch:3,arbeiten:1,versionen:3,host:[],abweichend:1,squeez:3,repositori:[0,5],wget:[6,1,5],about:4,page:[0,4,2],hier:[1,3],includ:5,done:[6,4],commit:[1,4,2],zum:1,genannten:1,own:5,quelleben:1,your:[6,5],administrationsrepo:[],merg:[1,2],git:[0,1,2,3,4,5,6],support:[],question:2,avail:5,rmdir:1,generisch:[],agnostisch:[],aktuel:[],subscrib:4,htpasswd:[],link:[0,4,2],evtl:1,newer:5,voraussetzungen:1,bug:[4,5],pull:2,"erm\u00f6glicht":[],computercamp:2,possibl:5,muster:[],checkout:[6,1],manuel:1,verwenden:1,creat:6,entpacken:1,mirror:5,neuest:1,intro:[0,2],zertfifikat:[],file:5,gesteuert:[],erfolgreich:1,"geh\u00f6rend":1,when:2,virtual:4,elementa
r:3,book:2,sich:1,branch:[1,3],test:5,eigentlich:1,erfolgt:[],stat:[],package_vers:1,xfz:1,mrconfig:6,besteht:[],dies:[1,3],debian:[0,1,2,3,4,5,6],lang:[],derzeit:[],servernamen:[],abweicht:[],holen:[],write:5,"verf\u00fcgbar":1,time:5,push:[6,0,2,1]},objtypes:{},titles:["debian.tryton.org","Packaging Workflow","Links","Layout","Mailing Lists","Tryton Debian Apt Repository","Download"],objnames:{},filenames:["index","packaging_workflow","links","git_layout","mailinglists","mirror","download"]})
\ No newline at end of file
+Search.setIndex({objects:{},terms:{scm:2,adminstr:[],dist:5,angezeigt:[],all:[6,1,4,5],selbst:[],zertifkatsverwaltung:[],follow:[4,5],locat:2,"skriptf\u00e4hig":[],auf:[1,3],berechtigung:[],entsprechend:1,intermedi:2,articl:[],under:5,sourc:[0,5],everi:5,risk:5,fals:[],neue:1,aktualisierung:[],verschiedenen:3,upstream:[1,3],unoffici:5,brows:0,probeinstal:1,administr:[],die:[1,3],list:[0,4,5],upload:4,"try":5,der:[1,3],dir:1,download:[6,0,5,1],index:0,what:2,konfigur:[],sub:3,access:[6,0],version:[1,2,5],mittlerweil:1,"new":5,"public":[],dem:[1,3],erstellen:1,ggf:1,path:6,sind:3,keydir:[],deb:5,tryton:[0,1,2,3,4,5,6],search:0,hgnest:[],mitgeforkt:3,ersten:1,cert:[],lokal:[],durch:[],pick:[1,2],via:[6,4,5],modul:[0,5],prefer:5,gitolit:[0,2,1],apt:[6,0,5,1],wir:1,instal:[6,0,5,1],txt:6,jedenfal:1,from:[2,5],commun:4,pref:5,regist:6,upgrad:5,usr:1,kurzanleitung:1,reconfigur:[],"gegenw\u00e4rtig":[],aufbau:3,stick:5,muss:3,must:6,reinkopieren:1,none:[],entfernen:[],setup:2,work:5,cat:[],
tag:1,can:[6,5],den:[1,3],simpel:[],purpos:6,root:[],control:2,mrtrust:6,tar:[1,3],systemweit:[],share:1,indic:0,"\u00fcber":[],want:5,tarbal:1,installier:1,pushen:1,alwai:5,chroot:1,multipl:2,geforkt:3,sic:1,how:2,kompress:1,sid:2,verifi:[],simpl:2,berechtigungen:[],usernamen:[],clone:[6,1],"zus\u00e4tzlich":3,zugang:[],"\u00e4nderungen":1,mai:5,usus:5,man:6,versehen:3,util:[],github:2,freigeschaltet:[],unterhalb:1,stackoverflow:2,help:2,quellen:[],entsprechen:[],doku:1,sitaramc:[],netz:[],zertifkat:[],committen:1,"k\u00f6nnen":3,polici:5,vth:3,fix:5,mail:[0,4],main:5,them:5,good:6,gitweb:[6,0,2],"m\u00fcssen":[],python:1,auth:[],paketlisten:[],wenn:1,gitstat:[],document:2,name:[1,5],changelog:1,anpassen:1,kombin:[],package_nam:6,each:6,found:[6,5],abbilden:3,sshuttl:[0,1,2,3,4,5,6],kann:[],replac:5,individu:2,"2vth":3,backport:[5,3],special:[0,2],out:2,"\u00fcberschrieben":[],gesamten:[],internen:3,content:[],werden:3,daniel:2,suitabl:5,experiment:1,workflow:[1,2,3],pub:[],asc:5,g
it:[0,1,2,3,4,5,6],releas:[1,5,3],org:[0,1,2,3,4,5,6],progit:[],allerd:[],exportieren:[],ist:1,thing:4,schemata:5,deshalb:1,imposs:5,pristin:[1,3],softwar:2,einer:[],directli:5,nach:[1,3],number:5,echo:[6,5],hook:[],ihn:[],"f\u00fcr":[1,3],prioriti:5,differ:5,gitreadi:2,convent:5,mkdir:[],system:2,messag:4,master:2,setzen:[],multirepositori:6,toc:2,nutzen:[],schema:5,tool:6,lighttpd:[],paket:1,conserv:5,dpkg:[],"3_distributed_workflow":2,bei:1,provid:5,tree:[6,0],project:[],dann:1,browser:[],pro:3,packag:[6,0,5,2,1],tabl:0,einpflegen:1,reposnam:1,"sp\u00e4ter":[],note:5,also:6,gepusht:3,prepar:1,distribut:[0,2,5],usernam:[],dateiendung:1,bzw:1,url:6,doc:1,einbinden:[],zertifikat:[],clean:1,cheat:[0,2],hostnam:[],eigen:1,layout:3,acquir:[],configur:6,sieh:1,hinterlegen:[],installieren:[],over:5,"ben\u00f6tigt":3,erstellung:[],get:[6,1,5],pave:[],repo:[1,3],ssl:[],ssh:[0,1,2,3,4,5,6],wheezi:[5,3],einbindung:[],crt:[],method:[],remot:2,stuff:[1,2],integr:[],freigegebenen:[],summari:6,w
iki:2,certif:[],ubunt:2,nur:3,nun:3,packen:1,fail:2,einfach:[],sammelverwaltung:[],wird:3,dauerhaft:[],"8vth":3,weiter:3,erledigt:[],listinfo:4,progress:2,signatur:5,kei:[6,5],einzelrepo:[],"ausw\u00e4hlen":[],admin:1,etc:[4,5],nicht:3,und:[1,3],com:2,overview:[0,4],linux:2,respect:5,guid:2,orig:1,mailman:4,creat:6,oder:[],due:5,entpacken:1,basic:[1,5,3],blob:[],create_mrconfig:6,those:5,therefor:5,look:5,amend:1,intro:[0,2],anonym:[6,0],ein:3,"\u00e4ndert":1,protcol:6,readi:5,vom:[],von:1,ansonsten:1,archiv:[4,5],conf:[],"\u00e4ndern":[],vorgenommen:[],zusatz:3,develop:[6,0,4],thei:5,make:5,unter:1,lintian:1,html:[1,2],aptabl:5,"\u00e4quival":[],incl:5,complet:[6,0],benutzten:[],http:[0,1,2,3,4,5,6],webserv:[],moment:5,user:[],reposerstellung:[],aktualisieren:[],client:5,thi:[6,5],"\u00f6ffentlich":3,paketen:1,eigenen:[],klonen:1,"funktionalit\u00e4t":[],web:[],typisch:3,add:[1,5],book:2,"n\u00e4chstem":[],distributionen:[],cherri:1,save:5,sich:1,debian_repo:[],trytond:1,read:4,vor
aussetzung:[],passwort:[],neuem:1,biz:[],server_2:1,anpassungen:1,rogerdudl:2,password:[],eigentlich:1,daemon:2,like:5,specif:2,mit:[1,3],unstabl:5,updat:[6,0,5],manag:2,eben:1,sollen:3,eintragen:1,cdwilson:2,intern:3,sampl:5,authent:[6,0],umbenennen:[],home:[],server:[6,1,5],transport:[],rsync:[],einsehbar:[],zugriff:[],per:3,pem:[],errtheblog:2,rmdir:1,benannt:3,gebrauch:3,arbeiten:1,versionen:3,host:[],abweichend:1,squeez:3,repositori:[0,5],wget:[6,1,5],about:4,page:[0,4,2],hier:[1,3],done:[6,4],commit:[1,4,2],zum:1,genannten:1,own:5,quelleben:1,your:[6,5],administrationsrepo:[],merg:[1,2],mkd:[],support:[],question:2,avail:5,includ:5,generisch:[],agnostisch:[],aktuel:[],subscrib:4,htpasswd:[],link:[0,4,2],evtl:1,newer:5,voraussetzungen:1,bug:[4,5],pull:2,"erm\u00f6glicht":[],computercamp:2,possibl:5,muster:[],checkout:[6,1],manuel:1,verwenden:1,pin:[0,5],erscheinen:3,mirror:5,neuest:1,jessi:5,zertfifikat:[],file:5,gesteuert:[],erfolgreich:1,"geh\u00f6rend":1,when:2,virtual:4,ele
mentar:3,other:5,futur:5,branch:[1,3],test:5,you:5,erfolgt:[],stat:[],package_vers:1,xfz:1,mrconfig:6,besteht:[],dies:[1,3],debian:[0,1,2,3,4,5,6],lang:[],derzeit:[],servernamen:[],abweicht:[],holen:[],write:5,"verf\u00fcgbar":1,time:5,push:[6,0,2,1]},objtypes:{},titles:["debian.tryton.org","Packaging Workflow","Links","Layout","Mailing Lists","Tryton Debian Apt Repository","Download"],objnames:{},filenames:["index","packaging_workflow","links","git_layout","mailinglists","mirror","download"]})
\ No newline at end of file
diff --git a/doc/source/mirror.rst b/doc/source/mirror.rst
index a03fae1..5a2e6bf 100644
--- a/doc/source/mirror.rst
+++ b/doc/source/mirror.rst
@@ -25,7 +25,7 @@ e.g. wheezy-2.2, wheezy-2.6, etc.
Packages suitable for testing and unstable are available under the distribution <Debian-Future-Release>-<Tryton-Version>
-e.g. at the time of writing jessie-2.6, jessie-2.8, etc.
+e.g. at the time of writing jessie-2.6, jessie-2.8, jessie-3.0 etc.
Available Distributions can be found at
@@ -74,6 +74,13 @@ There are ready-to-use source list files. They can be downloaded and saved direc
# cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-wheezy-2.8.list
+*Distribution wheezy-3.0*
+
+::
+
+ # cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-wheezy-3.0.list
+
+*
*Distribution jessie-2.2*
::
@@ -93,6 +100,12 @@ There are ready-to-use source list files. They can be downloaded and saved direc
# cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-2.8.list
+*Distribution jessie-3.0*
+
+::
+
+ # cd /etc/apt/sources.list.d && wget http://debian.tryton.org/debian/tryton-jessie-3.0.list
+
Installation
--
debian.tryton.org
More information about the tryton-debian-vcs
mailing list