mirror of
https://github.com/atom/atom.git
synced 2026-02-11 23:25:03 -05:00
116 lines
3.9 KiB
JavaScript
116 lines
3.9 KiB
JavaScript
/* vim:ts=4:sts=4:sw=4:
|
|
* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is Ajax.org Code Editor (ACE).
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Ajax.org B.V.
|
|
* Portions created by the Initial Developer are Copyright (C) 2010
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
* Julian Viereck <julian DOT viereck AT gmail DOT com>
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** 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.isEequal(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);
|
|
|
|
}); |