Returns the <code>start</code> element
@return the node defined for the element <code>start</code>
424964
public java.util.Date getStart()
   {
      if (childNode.getTextValueForPatternName("start") != null) {
         return XMLDate.toDate(childNode.getTextValueForPatternName("start"));
      }
      return null;
   }
336322
public int getStartingID()
    {
        if (this.getTable() != null)
            if (this.getTable().getDatabase() != null)
                return this.getTable().getDatabase().getStartingID();
        return super.getStartingID();   // Never (default)
    }
142057
public N getPartitionSuperNode(N node) {
    checkNotNull(colorToNodeMap, "No coloring founded. color() should be called first.");
    Color color = graph.getNode(node).getAnnotation();
    N headNode = colorToNodeMap[color.value];
    if (headNode == null) {
      colorToNodeMap[color.value] = node;
      return node;
    } else {
      return headNode;
    }
  }
1143809
public Node getRoot(Node node)
  {

    Node root = null;

    while (node != null)
    {
      root = node;
      node = getParentOfNode(node);
    }

    return root;
  }
125509
public boolean nextStartElement() throws XMLException, IOException {
		try {
			do {
				next();
			} while (!Type.START_ELEMENT.equals(event.type));
			return true;
		} catch (EOFException e) {
			return false;
		}
	}
1005022
public XMLWriter startElement(String element) {
        append("<" + element);
        if (rootElement && xmlns != null) {
            append(" xmlns=\"" + xmlns + "\"");
            rootElement = false;
        }
        append(">");
        elementStack.push(element);
        return this;
    }
319604
public Node currentNode() {
        if (!isInit) {
            init();
        }
        // See if we need to store state information.
        if ((lastUUIDTimeStored + nodeState.getSynchInterval()) > (findMaxTimestamp() / Clock.INTERVALS_PER_MILLI)) {
            try {
                nodeState.store(nodesSet);
            } catch (IOException ioe) {
               //@TODO add listener and send notify
            }
        }
        return allNodes[currentNodeIndex];
    }
1287758
public Node nextNode() {

		if (currentNode == null)
			return null;

		Node result = getFirstChild(currentNode);

		if (result != null) {
			currentNode = result;
			return result;
		}

		result = getNextSibling(currentNode);

		if (result != null) {
			currentNode = result;
			return result;
		}

		// return parent's 1st sibling.
		Node parent = getParentNode(currentNode);
		while (parent != null) {
			result = getNextSibling(parent);
			if (result != null) {
				currentNode = result;
				return result;
			} else {
				parent = getParentNode(parent);
			}
		}

		// end , return null
		return null;
	}
1071029
public Node previousSibling() {
        if (parentNode == null)
            return null; // root

        if (siblingIndex > 0)
            return parentNode.ensureChildNodes().get(siblingIndex-1);
        else
            return null;
    }
1316233
public static <T extends GraphNode<T>> T getFirstChild(T node) {
        return hasChildren(node) ? node.getChildren().get(0) : null;
    }
1168629
public E getFirst() {
        final Node<E> f = first;
        if (f == null)
            throw new NoSuchElementException();
        return f.item;
    }
928738
public Calendar getStart() {
		Calendar cal = Calendar.getInstance();
		cal.setTimeInMillis(start);
		return cal;
	}
1089418
function (start, end) {
            var ret = null, l;
            l = end - start;
            if (l > 0) {
                ret = this.nodeFactory.createCDataNode(this.page, start, end);
            }
            return ret;
        }
22863
public int getStartingID()
    {
        int iStartingID = 1;   // (default)
        if (this.getProperty(STARTING_ID) != null)
        {
            try {
                iStartingID = Integer.parseInt(this.getProperty(STARTING_ID));
            } catch (NumberFormatException e) {
                iStartingID = 1;
            }
        }
        return iStartingID;
    }
285345
public Node<T> getPrevious(long value) {
    	if (value == first.value) return null;
    	if (value == root.value) {
    		if (root.left == null) return null;
    		Node<T> n = root.left;
    		while (n.right != null) n = n.right;
    		return n;
    	}
    	if (value < root.value) {
    		if (root.left == null) return null;
    		return getPrevious(root.left, value);
    	}
    	if (root.right == null) return null;
    	return getPrevious(root, root.right, value);
    }
149872
public R startClosed(@Nonnull T start) {
    this.start = Preconditions.checkNotNull(start, "Start can't be null");
    this.startBound = BoundType.CLOSED;
    return thisT();
  }
120133
public Node<T> getMin() {
		if (size == 0) return null;
		Node<RedBlackTreeLong<T>> e = ranges.getMin();
		return e.getElement().getMin();
	}