wisemapping-frontend/packages/mindplot/src/components/layout/AbstractBasicSorter.ts

76 lines
2.4 KiB
TypeScript

/* eslint-disable class-methods-use-this */
/*
* Copyright [2021] [wisemapping]
*
* Licensed under WiseMapping Public License, Version 1.0 (the "License").
* It is basically the Apache License, Version 2.0 (the "License") plus the
* "powered by wisemapping" text requirement on every single page;
* you may not use this file except in compliance with the License.
* You may obtain a copy of the license at
*
* http://www.wisemapping.org/license
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import PositionType from '../PositionType';
import ChildrenSorterStrategy from './ChildrenSorterStrategy';
import Node from './Node';
import RootedTreeSet from './RootedTreeSet';
abstract class AbstractBasicSorter extends ChildrenSorterStrategy {
private INTERNODE_VERTICAL_PADDING = 5;
computeChildrenIdByHeights(treeSet: RootedTreeSet, node: Node) {
const result = {};
this._computeChildrenHeight(treeSet, node, result);
return result;
}
protected _getVerticalPadding() {
return this.INTERNODE_VERTICAL_PADDING;
}
protected _computeChildrenHeight(treeSet: RootedTreeSet, node: Node, heightCache?) {
// 2* Top and down padding;
const height = node.getSize().height + this._getVerticalPadding() * 2;
let result;
const children = treeSet.getChildren(node);
if (children.length === 0 || node.areChildrenShrunken()) {
result = height;
} else {
let childrenHeight = 0;
children.forEach((child) => {
childrenHeight += this._computeChildrenHeight(treeSet, child, heightCache);
});
result = Math.max(height, childrenHeight);
}
if (heightCache) {
// eslint-disable-next-line no-param-reassign
heightCache[node.getId()] = result;
}
return result;
}
protected _getSortedChildren(treeSet: RootedTreeSet, node: Node) {
const result = treeSet.getChildren(node);
result.sort((a, b) => a.getOrder() - b.getOrder());
return result;
}
protected _getRelativeDirection(reference: PositionType, position: PositionType): 1 | -1 {
const offset = position.x - reference.x;
return offset >= 0 ? 1 : -1;
}
}
export default AbstractBasicSorter;