for (int i= 0; i < children.size(); i++) {
for (int i= children.size() - 1; i >= 0; i--) {
	private static void insert(TextEdit parent, TextEdit edit) {		List children= parent.getChildren();		if (children == null) {			parent.internalAdd(edit);			return;		}		// Can be optimize using binary search		for (Iterator iter= children.iterator(); iter.hasNext();) {			TextEdit child= (TextEdit)iter.next();			if (child.getTextRange().covers(edit.getTextRange())) {				insert(child, edit);				return;			}		}		for (int i= 0; i < children.size(); i++) {			TextEdit child= (TextEdit)children.get(i);			if (edit.getTextRange().covers(child.getTextRange())) {				parent.remove(i);				edit.internalAdd(child);				parent.internalAdd(edit);				return;			}		}		parent.internalAdd(edit);	}