17 	Graph.prototype.foldCells = function(collapse, recurse, cells, checkFoldable, evt)  argument
21 		if (cells == null)
23 			cells = this.getFoldableCells(this.getSelectionCells(), collapse);
31 			var newCells = cells.slice();
34 			for (var i = 0; i < cells.length; i++)
36 				if (mxUtils.getValue(this.getCurrentCellStyle(cells[i]),
39 					this.foldTreeCell(collapse, cells[i]);
43 			cells = newCells;
44 			cells = graphFoldCells.apply(this, arguments);
51 		return cells;
352 		graph.removeCells = function(cells, includeEdges)  argument
356 			if (cells == null)
358 				cells = this.getDeletableCells(this.getSelectionCells());
366 				cells = this.getDeletableCells(this.addAllEdges(cells));
371 			for (var i = 0; i < cells.length; i++)
373 				var target = cells[i];
405 						var edges = graph.getIncomingTreeEdges(cells[i]);
406 						cells = cells.concat(edges);
411 					tmp.push(cells[i]);
415 			cells = tmp;
427 		graph.duplicateCells = function(cells, append)  argument
429 			cells = (cells != null) ? cells : this.getSelectionCells();
430 			var temp = cells.slice(0);
444 						mxUtils.remove(edges[j], cells);
452 				var result = graphDuplicateCells.call(this, cells, append);
454 				if (result.length == cells.length)
456 					for (var i = 0; i < cells.length; i++)
458 						if (isTreeVertex(cells[i]))
461 							var edges = graph.getIncomingTreeEdges(cells[i]);
483 		graph.moveCells = function(cells, dx, dy, clone, target, evt, mapping)  argument
493 				if (cells != null && isTreeVertex(target) && mxUtils.getValue(style, 'treeFolding', '0') == '1')
496 					for (var i = 0; i < cells.length; i++)
498 						if (isTreeVertex(cells[i]) || (graph.model.isEdge(cells[i]) &&
499 							graph.model.getTerminal(cells[i], true) == null))
501 							target = graph.model.getParent(cells[i]);
507 					if (newSource != null && target != newSource && this.view.getState(cells[0]) != null)
509 						var edges = graph.getIncomingTreeEdges(cells[0]);
531 				if (result != null && cells != null && result.length == cells.length)
545 						else if (isTreeVertex(cells[i]))
547 							var edges = graph.getIncomingTreeEdges(cells[i]);
553 									if (isTreeVertex(newSource) && mxUtils.indexOf(cells,
567 										if (temp == null || temp == graph.model.getParent(cells[i]))
1098 					var cells = null;
1104 							cells = (mxEvent.isShiftDown(evt)) ?
1110 							cells = addSibling(graph.getSelectionCell(), !mxEvent.isShiftDown(evt));
1114 					if (cells != null && cells.length > 0)
1116 						if (cells.length == 1 && graph.model.isEdge(cells[0]))
1118 							graph.setSelectionCell(graph.model.getTerminal(cells[0], false));
1122 							graph.setSelectionCell(cells[cells.length - 1]);
1216 			var cells = [initialCell];
1227 					if (treeEdge && mxUtils.indexOf(cells, edge) < 0)
1229 						cells.push(edge);
1233 						mxUtils.indexOf(cells, vertex) < 0)
1235 						cells.push(vertex);
1242 			return cells;