本文整理匯總了TypeScript中ag-grid/main.GridOptionsWrapper.isSuppressParentsInRowNodes方法的典型用法代碼示例。如果您正苦於以下問題：TypeScript GridOptionsWrapper.isSuppressParentsInRowNodes方法的具體用法？TypeScript GridOptionsWrapper.isSuppressParentsInRowNodes怎麽用？TypeScript GridOptionsWrapper.isSuppressParentsInRowNodes使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類ag-grid/main.GridOptionsWrapper的用法示例。
在下文中一共展示了GridOptionsWrapper.isSuppressParentsInRowNodes方法的1個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的TypeScript代碼示例。
示例1: group
private group(rowNodes: RowNode[], groupedCols: Column[], expandByDefault: number) {
var topMostGroup = new RowNode();
this.context.wireBean(topMostGroup);
topMostGroup.level = -1;
topMostGroup.children = [];
topMostGroup._childrenMap = {};
var allGroups: RowNode[] = [];
allGroups.push(topMostGroup);
var levelToInsertChild = groupedCols.length - 1;
var i: number;
var currentLevel: number;
var node: RowNode;
var currentGroup: any;
var groupKey: string;
var nextGroup: RowNode;
var includeParents = !this.gridOptionsWrapper.isSuppressParentsInRowNodes();
// start at -1 and go backwards, as all the positive indexes
// are already used by the nodes.
var index = -1;
for (i = 0; i < rowNodes.length; i++) {
node = rowNodes[i];
// all leaf nodes have the same level in this grouping, which is one level after the last group
node.level = levelToInsertChild + 1;
for (currentLevel = 0; currentLevel < groupedCols.length; currentLevel++) {
var groupColumn = groupedCols[currentLevel];
groupKey = this.valueService.getValue(groupColumn, node);
if (currentLevel === 0) {
currentGroup = topMostGroup;
}
// if group doesn't exist yet, create it
nextGroup = currentGroup._childrenMap[groupKey];
if (!nextGroup) {
nextGroup = new RowNode();
this.context.wireBean(nextGroup);
nextGroup.group = true;
nextGroup.field = groupColumn.getColDef().field;
nextGroup.id = index--;
nextGroup.key = groupKey;
nextGroup.expanded = this.isExpanded(expandByDefault, currentLevel);
nextGroup.children = [];
// for top most level, parent is null
nextGroup.parent = null;
nextGroup.allChildrenCount = 0;
nextGroup.level = currentGroup.level + 1;
// this is a temporary map, we remove at the end of this method
nextGroup._childrenMap = {};
if (includeParents) {
nextGroup.parent = currentGroup === topMostGroup ? null : currentGroup;
}
currentGroup._childrenMap[groupKey] = nextGroup;
currentGroup.children.push(nextGroup);
allGroups.push(nextGroup);
}
nextGroup.allChildrenCount++;
if (currentLevel == levelToInsertChild) {
if (includeParents) {
node.parent = nextGroup === topMostGroup ? null : nextGroup;
}
nextGroup.children.push(node);
} else {
currentGroup = nextGroup;
}
}
}
//remove the temporary map
for (i = 0; i < allGroups.length; i++) {
delete allGroups[i]._childrenMap;
}
return topMostGroup.children;
}