o != arg0 is the same as !(o == (arg0)).
o != arg0 is the same as !(o == (arg0)).
the object to compare against this object for dis-equality.
false if the receiver object is equivalent to the argument; true otherwise.
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
o == arg0 is the same as o.equals(arg0).
o == arg0 is the same as o.equals(arg0).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
[use case] Performs a shallow-select on the XML tree according to the specified selector function.
Performs a shallow-select on the XML tree according to the specified selector function. Shallow selection is defined according to the following expression:
Performs a shallow-select on the XML tree according to the specified selector function.
Performs a shallow-select on the XML tree according to the specified selector function. Shallow selection is defined according to the following expression:
nodes flatMap {
case Elem(_, _, children) => children collect selector
case _ => Group()
}
In English, this means that a shallow selection works by first selectingonly the Elem(s) at the top level and then filtering their children according to the selector. The results of these filtrations are concatenated together, producing a single flattened result.
Very important: This is not the same as the XPath / operator!
(nor does it strive to be) XPath is inconsistent in its selection semantics,
varying them slightly depending on whether or not you are selecting from
the top level or in the middle of a compound expression. As a result, it
is categorically impossible to implement XPath in a combinatorial
fashion. Rather than give up on combinators, we chose to give up on XPath.
In practice, this "select child Elem(s), then filter their children" behavior
tends to be the most useful variant of the XPath selection. The "missed"
case here is applying a filter to the top-level set of nodes. This is
currently not handled by the API (perhaps in future). For now, if you need
this functionality, it's pretty easy to get it using the filter method.
The results of this function will be a collection of some variety, but the exact type is determined by the selector itself. For example:
val ns: Group[Node] = ... ns \ "name" ns \ * ns \ text
The three selection expressions here produce very different results. The
first will produce a collection of type Zipper[Elem],
the second will produce Zipper[Node],
while the third will produce
scala.collection.Traversable[scala.String].
This reflects the fact that the selector produced (by implicit conversion)
from a String will only filter for nodes of type Elem.
However, the * selector will filter for all nodes (as the wildcard
symbol would suggest) and thus it must return a collection containing the
fully-generic Node. Finally, the text selector
specifically pulls out the textual contents of nodes, and thus its results
will not be nodes at all, but raw String(s).
Whenever supported by the resulting collection type, the selection operation will preserve a "backtrace", or an "undo log" of sorts. This backtrace is known as a zipper context. This context makes it possible to operate on the collection resulting from performing a selection, then unselect to rebuild the original collection around it (modulo the changes made). This provides a very clean and powerful way of drilling down into an XML tree, making some changes and then realizing those changes within the context of the full tree. In a sense, it solves the major inconvenience associated with immutable tree structures: the need to manually rebuild the entire ancestry of the tree after making a change somewhere within.
[use case] Performs a deep-select on the XML tree according to the specified selector function.
Performs a deep-select on the XML tree according to the specified selector function. Deep selection is defined according to the following recursion:
Performs a deep-select on the XML tree according to the specified selector function.
Performs a deep-select on the XML tree according to the specified selector function. Deep selection is defined according to the following recursion:
val recursive = nodes flatMap {
case Elem(_, _, _, children) => children \\ selector
case _ => Group()
}
(this \ selector) ++ recursive
In English, this means that deep selection is defined simply as the recursive
application of shallow selection (\), all the way from the root down to the
leaves. Note that the recursion does not short circuit when a result is
found. Thus, if a parent node matches the selector as well as one of its
children, then both the parent and the child will be returned, with the
parent preceeding the child in the results.
Just as with shallow selection, the very outermost level of the group is not
considered in the selection. Thus, deep selection is not exactly the
same as the XPath // operator, since // will consider the outermost level,
while Anti-XML's deep selection \\ will not.
Note: For certain selectors (such as an element name selector defined
using a String or Symbol), the result of this method will be a zipper,
similar to the results from the shallow-select operator (\). This zipper
will not be valid! Zipper context synthesis for deep selection is
currently unimplemented. Thus, any attempt to use the unselect method on
the resulting zipper will likely throw an exception. At the very least, it
won't return a useful result. The implementation of this feature is ongoing.
This method is used to cast the receiver object to be of type T0.
This method is used to cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as
part of compilation it is not possible to check whether the contents of the list are of the requested typed.
the receiver object.
This method creates and returns a copy of the receiver object.
This method creates and returns a copy of the receiver object.
The default implementation of the clone method is platform dependent.
a copy of the receiver object.
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef:
* It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true.
* It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and
only if y.eq(x) returns true.
* It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other properties.
* It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of
x.eq(y) consistently returns true or consistently returns false.
* For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
* null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is
consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they
should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
the object to compare against this object for reference equality.
true if the argument is a reference to the receiver object; false otherwise.
This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.
This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.
The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence
relation]:
* It is reflexive: for any instance x of type Any, x.equals(x) should return true.
* It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and
only if y.equals(x) returns true.
* It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and
y.equals(z) returns true, then x.equals(z) should return true.
If you override this method, you should verify that your implementation remains an equivalence relation.
Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects
that are "equal" (o1.equals(o2) returns true) hash to the same
scala.Int
(o1.hashCode.equals(o2.hashCode)).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.
Returns a representation that corresponds to the dynamic class of the receiver object.
Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
Returns a hash code value for the object.
Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet
not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0.
However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have
identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure
to verify that the behavior is consistent with the equals method.
the hash code value for the object.
This method is used to test whether the dynamic type of the receiver object is T0.
This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will
return true. In the latter example, because the type argument is erased as part of compilation it is not
possible to check whether the contents of the list are of the requested typed.
true if the receiver object is an instance of erasure of type T0; false otherwise.
o.ne(arg0) is the same as !(o.eq(arg0)).
o.ne(arg0) is the same as !(o.eq(arg0)).
the object to compare against this object for reference dis-equality.
false if the argument is not a reference to the receiver object; true otherwise.
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Returns a string representation of the object.
Returns a string representation of the object.
The default representation is platform dependent.
a string representation of the object.