108 lines
3.8 KiB
JavaScript
108 lines
3.8 KiB
JavaScript
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Distributed under the BSD license:
|
|
*
|
|
* Copyright (c) 2010, Ajax.org B.V.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
* * Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* * Neither the name of Ajax.org B.V. nor the
|
|
* names of its contributors may be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL AJAX.ORG B.V. BE LIABLE FOR ANY
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
define(function(require, exports, module) {
|
|
"use strict";
|
|
|
|
/*
|
|
* Simple fold-data struct.
|
|
**/
|
|
var Fold = exports.Fold = function(range, placeholder) {
|
|
this.foldLine = null;
|
|
this.placeholder = placeholder;
|
|
this.range = range;
|
|
this.start = range.start;
|
|
this.end = range.end;
|
|
|
|
this.sameRow = range.start.row == range.end.row;
|
|
this.subFolds = [];
|
|
};
|
|
|
|
(function() {
|
|
|
|
this.toString = function() {
|
|
return '"' + this.placeholder + '" ' + this.range.toString();
|
|
};
|
|
|
|
this.setFoldLine = function(foldLine) {
|
|
this.foldLine = foldLine;
|
|
this.subFolds.forEach(function(fold) {
|
|
fold.setFoldLine(foldLine);
|
|
});
|
|
};
|
|
|
|
this.clone = function() {
|
|
var range = this.range.clone();
|
|
var fold = new Fold(range, this.placeholder);
|
|
this.subFolds.forEach(function(subFold) {
|
|
fold.subFolds.push(subFold.clone());
|
|
});
|
|
return fold;
|
|
};
|
|
|
|
this.addSubFold = function(fold) {
|
|
if (this.range.isEqual(fold))
|
|
return this;
|
|
|
|
if (!this.range.containsRange(fold))
|
|
throw "A fold can't intersect already existing fold" + fold.range + this.range;
|
|
|
|
var row = fold.range.start.row, column = fold.range.start.column;
|
|
for (var i = 0, cmp = -1; i < this.subFolds.length; i++) {
|
|
cmp = this.subFolds[i].range.compare(row, column);
|
|
if (cmp != 1)
|
|
break;
|
|
}
|
|
var afterStart = this.subFolds[i];
|
|
|
|
if (cmp == 0)
|
|
return afterStart.addSubFold(fold);
|
|
|
|
// cmp == -1
|
|
var row = fold.range.end.row, column = fold.range.end.column;
|
|
for (var j = i, cmp = -1; j < this.subFolds.length; j++) {
|
|
cmp = this.subFolds[j].range.compare(row, column);
|
|
if (cmp != 1)
|
|
break;
|
|
}
|
|
var afterEnd = this.subFolds[j];
|
|
|
|
if (cmp == 0)
|
|
throw "A fold can't intersect already existing fold" + fold.range + this.range;
|
|
|
|
var consumedFolds = this.subFolds.splice(i, j - i, fold);
|
|
fold.setFoldLine(this.foldLine);
|
|
|
|
return fold;
|
|
};
|
|
|
|
}).call(Fold.prototype);
|
|
|
|
});
|