Java Doc for RDFListImpl.java in  » RSS-RDF » Jena-2.5.5 » com » hp » hpl » jena » rdf » model » impl » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Standard implementation the list abstraction from rdf.model.

Construct an implementation of RDFList in the given graph, where the given node is the head of the list.

Add the given value to the end of the list.

Answer a new list that is formed by adding each element of this list to the head of the the list formed from the given nodes.

Answer a new list that is formed by adding each element of this list to the head of the given list.

Apply a function to each value in the list in turn.

Answer the contents of this RDF list as a Java list of RDFNode values.

Check that the current list cell is not the nil list, and throw an empty list exception if it is.

Answer true if this is a valid list cell, which means either that it is nil, or it has the appropriate type and a first and next relation. Updated 17-06-2003: RDFCore last comments process has decided that the rdf:type of a list is implied by the domain constraints on rdf:first and rdf:rest, so no longer needs to be asserted directly.

Change the tail of this list to point to the given list, so that this list becomes the list of the concatenation of the elements of both lists. This is a side-effecting operation on this list; for a non side-effecting alternative, see RDFListImpl.append .

Add the nodes returned by the given iterator to the end of this list.

Return a reference to a new list cell whose head is value and whose tail is this list.

Answer true if the given node appears as the value of a value of any of the cells of this list.

Answer a list that contains all of the elements of this list in the same order, but is a duplicate copy in the underlying model.

Create a copy of the list of nodes returned by an iterator.

Find and return an element of this list - either the last element before the end of the list, or the i'th element from the front (starting from zero).

Answer the node that is the i'th element of the list, assuming that the head is item zero.

Answer the value that is at the head of the list.

Answer true lists are operating in strict mode, in which the well- formedness of the list is checked at every operation.

Answer the list that is the tail of this list.

Answer the error message returned by the last failed validity check, if any.

Answer the index of the first occurrence of the given value in the list, or -1 if the value is not in the list.

Answer the index of the first occurrence of the given value in the list after index start, or -1 if the value is not in the list after the given start point.

Answer true if the list is well-formed, by checking that each node is correctly typed, and has a head and tail pointer from the correct vocabulary.

Answer an iterator over the elements of the list.

Construct a new list cell with the given value and tail.

Apply a function to each value in the list in turn, accumulating the results in an accumulator.

Remove the given value from this list.

Deprecated.

Remove the value from the head of the list.

Remove all of the components of this list from the model.

Replace the value at the i'th position in the list with the given value.

Answer true if this list has the same elements in the same order as the given list.

Update the head of the list to have the given value, and return the previous value.

Set a flag to indicate whether to strictly check the well-formedness of lists at each operation.

Update the list cell at the front of the list to have the given list as tail.

Helper method for setting the list tail, that assumes we have a resource that is a list.

Answer the number of elements in the list.

Answer the list that is this list with the given value added to the end of the list.

Construct an implementation of RDFList in the given graph, where the given node is the head of the list.

Add the given value to the end of the list. This is a side-effecting operation on the underlying model that is only defined if this is not the empty list. If this list is the empty (nil) list, we cannot perform a side-effecting update without changing the URI of this node (from rdf:nilRDFListImpl.with and RDFListImpl.cons .

Answer a new list that is formed by adding each element of this list to the head of the the list formed from the given nodes. This is a non side-effecting operation on either this list or the given list, but generates a copy of this list. For a more storage efficient alternative, see RDFListImpl.concatenate concatenate .

Answer a new list that is formed by adding each element of this list to the head of the given list. This is a non side-effecting operation on either this list or the given list, but generates a copy of this list. For a more storage efficient alternative, see RDFListImpl.concatenate concatenate .

Apply a function to each value in the list in turn.

Answer the contents of this RDF list as a Java list of RDFNode values.

Check that the current list cell is not the nil list, and throw an empty list exception if it is.

Answer true if this is a valid list cell, which means either that it is nil, or it has the appropriate type and a first and next relation. Updated 17-06-2003: RDFCore last comments process has decided that the rdf:type of a list is implied by the domain constraints on rdf:first and rdf:rest, so no longer needs to be asserted directly. The test for rdf:type has therefore been removed.

Answer a set of all of the RDF statements whose subject is one of the cells of this list.

Change the tail of this list to point to the given list, so that this list becomes the list of the concatenation of the elements of both lists. This is a side-effecting operation on this list; for a non side-effecting alternative, see RDFListImpl.append . Due to the problem of maintaining the URI invariant on a node, this operation will throw an exception if an attempt is made to concatenate onto an empty list. To avoid this, test for an empty list: if true replace the empty list with the argument list, otherwise proceed with the concatenate as usual. An alternative solution is to use RDFListImpl.append and replace the original list with the return value.

Add the nodes returned by the given iterator to the end of this list.

Return a reference to a new list cell whose head is value and whose tail is this list.

Answer true if the given node appears as the value of a value of any of the cells of this list.

Answer a list that contains all of the elements of this list in the same order, but is a duplicate copy in the underlying model.

Create a copy of the list of nodes returned by an iterator.

Find and return an element of this list - either the last element before the end of the list, or the i'th element from the front (starting from zero). Note that this method assumes the pre-condition that this is not the empty list.

Answer the node that is the i'th element of the list, assuming that the head is item zero. If the list is too short to have an i'th element, throws a ListIndexException .

Answer the value that is at the head of the list.

Answer true lists are operating in strict mode, in which the well- formedness of the list is checked at every operation.

Answer the list that is the tail of this list.

Answer the error message returned by the last failed validity check, if any.

Answer the index of the first occurrence of the given value in the list, or -1 if the value is not in the list.

Answer the index of the first occurrence of the given value in the list after index start, or -1 if the value is not in the list after the given start point.

Answer true if the list is well-formed, by checking that each node is correctly typed, and has a head and tail pointer from the correct vocabulary.

Answer an iterator over the elements of the list. Note that this iterator does not take a snapshot of the list, so changes to the list statements in the model while iterating will affect the behaviour of the iterator. To get an iterator that is not affected by model changes, use RDFListImpl.asJavaList .

Answer an iterator of the elements of this list, to each of which the given map function has been applied.

Construct a new list cell with the given value and tail.

Apply a function to each value in the list in turn, accumulating the results in an accumulator. The final value of the accumulator is returned as the value of reduce().

Remove the given value from this list. If val does not occur in the list, no action is taken. Since removing the head of the list will invalidate the list head cell, in general the list must return the list that results from this operation. However, in many cases the return value will be the same as the object that this method is invoked on

Deprecated. Since an RDFList does not behave like a Java container, it is not the case that the contents of the list can be removed and the container filled with values again. Therefore, this method name has been deprecated in favour of RDFListImpl.removeList

Remove the value from the head of the list. The tail of the list remains in the model. Note that no changes are made to list cells that point to this list cell as their tail. Immediately following a removeHead operation, such lists will be in a non-valid state.

Remove all of the components of this list from the model. Once this operation has completed, the RDFList resource on which it was called will no longer be a resource in the model, so further methods calls on the list object (for example, RDFListImpl.size will fail. Due to restrictions on the encoding of lists in RDF, it is not possible to perform an operation which empties a list and then adds further values to that list. Client code wishing to perform such an operation should do so in two steps: first remove the old list, then create a new list with the new contents. It is important that RDF statements that reference the old list (in the object position) be updated to point to the newly created list. Note that this is operation is only removing the list cells themselves, not the resources referenced by the list - unless being the object of an rdf:first statement is the only mention of that resource in the model.

Replace the value at the i'th position in the list with the given value. If the list is too short to have an i'th element, throws a ListIndexException .

Answer true if this list has the same elements in the same order as the given list. Note that the standard equals test just tests for equality of two given list cells. While such a test is sufficient for many purposes, this test provides a broader equality definition, but is correspondingly more expensive to test.

Update the head of the list to have the given value, and return the previous value.

Set a flag to indicate whether to strictly check the well-formedness of lists at each operation. Default false. Note that the flag that is manipulated is actually a static: it applies to all lists. However, RDFList is a Java interface, and Java does not permit static methods in interfaces.

Update the list cell at the front of the list to have the given list as tail. The old tail is returned, and remains in the model.

Helper method for setting the list tail, that assumes we have a resource that is a list.

Answer the number of elements in the list.

Answer the list that is this list with the given value added to the end of the list. This operation differs from RDFListImpl.add in that it will always work, even on an empty list, but the return value is the updated list. Specifically, in the case of adding a value to the empty list, the returned list will not be the same as this list. Client code should not assume that this is an in-place update, but should ensure that the resulting list is asserted back into the graph into the appropriate relationships.