jmlparser-core/com.github.javaparser.ast/NodeList

NodeList

open class NodeList<N : Node?> : List<N> , Iterable<N> , HasParentNode<NodeList<N>> , Visitable, Observable(source)

A list of nodes. It usually has a parent node. Unlike normal Nodes, this does not mean that it is a child of that parent. Instead, this list will make every node it contains a child of its parent. This way, a NodeList does not create an extra level inside the AST.

Parameters

<N>

the type of nodes contained.

Constructors

constructor()

constructor(n: Collection<N>)

constructor(n: Array<N>)

Functions

open fun <R, A> accept(v: GenericVisitor<R, A>, arg: A): R

open fun <A> accept(v: VoidVisitor<A>, arg: A)

Accept method for visitor support.

open fun add(node: N): Boolean

open fun add(index: Int, node: N)

open fun addAfter(node: N, afterThisNode: N): NodeList<N>

Inserts the node after afterThisNode.

open fun addAll(otherList: NodeList<N>)

open fun addAll(c: Collection<out N>): Boolean

open fun addAll(index: Int, c: Collection<out N>): Boolean

open fun addBefore(node: N, beforeThisNode: N): NodeList<N>

Inserts the node before beforeThisNode.

open fun addFirst(e: E)

open fun addLast(e: E)

open fun addNFirst(node: N): NodeList<N>

Inserts the node before all other nodes.

open fun addNLast(node: N): NodeList<N>

Inserts the node after all other nodes.

open fun clear()

open fun contains(node: N): Boolean

open fun contains(o: Any): Boolean

open fun containsAll(c: Collection<out Any>): Boolean

open fun <E> copyOf(coll: Collection<out E>): List<E>

open fun equals(o: Any): Boolean

open fun <N> findAncestor(types: Array<Class<N>>): Optional<N>

Walks the parents of this node and returns the first node of type type, or empty() if none is found.

open fun <N> ~~findAncestor~~(type: Class<N>, predicate: Predicate<N>): Optional<N>

Walks the parents of this node and returns the first node of type type that matches predicate, or empty() if none is found.

open fun <N> findAncestor(predicate: Predicate<N>, types: Array<Class<N>>): Optional<N>

Walks the parents of this node and returns the first node that matches one of types types, or empty() if none is found.

open fun forEach(action: Consumer<in N>)

open fun get(i: Int): N

open fun getFirst(): E

open fun getLast(): E

open fun getOFirst(): Optional<N>

open fun getOLast(): Optional<N>

open fun getParentNode(): Optional<Node>

Returns the parent node, or Optional.empty if no parent is set.

getParentNodeForChildren

open fun getParentNodeForChildren(): Node

Returns the parent node from the perspective of the children of this node.

open fun hashCode(): Int

open fun hasParentNode(): Boolean

Returns true if the parent has a parent

open fun ifNonEmpty(consumer: Consumer<in NodeList<N>>)

open fun indexOf(o: Any): Int

open fun isDescendantOf(ancestor: Node): Boolean

Determines whether this HasParentNode node is a descendant of the given node.

open fun isEmpty(): Boolean

open fun isNonEmpty(): Boolean

open fun isRegistered(observer: AstObserver): Boolean

Was this observer registered?

open fun iterator(): Iterator<N>

open fun lastIndexOf(o: Any): Int

open fun listIterator(): ListIterator<N>

open fun listIterator(index: Int): ListIterator<N>

open fun <X : Node?> nodeList(nodes: Array<X>): NodeList<X>

open fun <X : Node?> nodeList(nodes: NodeList<X>): NodeList<X>

open fun <X : Node?> nodeList(nodes: Collection<X>): NodeList<X>

open fun <E> of(): List<E>

open fun parallelStream(): Stream<N>

open fun register(observer: AstObserver)

Register an observer.

open fun remove(node: Node): Boolean

open fun remove(index: Int): N

open fun remove(o: Any): Boolean

open fun removeAll(c: Collection<out Any>): Boolean

open fun removeFirst(): N

open fun removeIf(filter: Predicate<in N>): Boolean

open fun removeLast(): N

open fun replace(old: N, replacement: N): Boolean

Replaces the first node that is equal to "old" with "replacement".

open fun replaceAll(operator: UnaryOperator<N>)

open fun retainAll(c: Collection<out Any>): Boolean

open fun reversed(): List<E>

abstract fun reversed(): SequencedCollection<E>

open fun set(index: Int, element: N): N

open fun setParentNode(parentNode: Node): NodeList<N>

Sets the parentNode

open fun size(): Int

open fun sort(comparator: Comparator<in N>)

open fun spliterator(): Spliterator<N>

open fun stream(): Stream<E>

open fun subList(fromIndex: Int, toIndex: Int): List<N>

open fun toArray(): Array<Any>

open fun <T> toArray(a: Array<T>): Array<T>

open fun <T : Node?> toNodeList(): Collector<T, NodeList<T>, NodeList<T>>

open fun toString(): String

open fun unregister(observer: AstObserver)

Unregister an observer.