private boolean inNegation() { int notIndex = operatorStack.lastIndexOf(Ops.NOT); if (notIndex > -1) { int existsIndex = operatorStack.lastIndexOf(Ops.EXISTS); return notIndex > existsIndex; } return false; }
/** * Given a prefix, this will return the namespace URI most * rencently (topmost) associated with that prefix. * * @param prefix <code>String</code> namespace prefix. * @return <code>String</code> - the namespace URI for that prefix. */ public String getURI(String prefix) { int index = prefixes.lastIndexOf(prefix); if (index == -1) { return null; } String uri = (String)uris.elementAt(index); return uri; }
/** * Given a prefix, this will return the namespace URI most rencently (topmost) associated with * that prefix. * * @param prefix <code>String</code> namespace prefix. * @return <code>String</code> - the namespace URI for that prefix. */ public String getURI(String prefix) { int index=prefixes.lastIndexOf(prefix); if (index == -1) { return null; } return uris.elementAt(index); }
/** * Returns the index of the first occurrence of the object. * * @return the index of the first occurrence of the object * @param o * the object to be searched */ public synchronized int search(Object o) { int index= lastIndexOf(o); if (index >= 0) return (size() - index); return -1; } }
/** * Given a prefix, this will return the namespace URI most * rencently (topmost) associated with that prefix. * * @param prefix <code>String</code> namespace prefix. * @return <code>String</code> - the namespace URI for that prefix. */ public String getURI( String prefix ) { int index = prefixes.lastIndexOf( prefix ); if ( index == -1 ) { return null; } String uri = (String) uris.elementAt( index ); return uri; }
/** * Returns the 1-based position where an object is on this stack. * If the object <tt>o</tt> occurs as an item in this stack, this * method returns the distance from the top of the stack of the * occurrence nearest the top of the stack; the topmost item on the * stack is considered to be at distance <tt>1</tt>. The <tt>equals</tt> * method is used to compare <tt>o</tt> to the * items in this stack. * * @param o the desired object. * @return the 1-based position from the top of the stack where * the object is located; the return value <code>-1</code> * indicates that the object is not on the stack. */ public synchronized int search(Object o) { int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1; }
/** * Returns the 1-based position where an object is on this stack. * If the object <tt>o</tt> occurs as an item in this stack, this * method returns the distance from the top of the stack of the * occurrence nearest the top of the stack; the topmost item on the * stack is considered to be at distance <tt>1</tt>. The <tt>equals</tt> * method is used to compare <tt>o</tt> to the * items in this stack. * * @param o the desired object. * @return the 1-based position from the top of the stack where * the object is located; the return value <code>-1</code> * indicates that the object is not on the stack. */ public synchronized int search(Object o) { int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1; }
/** * Method to retrieve the last position of the element. * @param element The element * @return The last position of this element in the List. **/ public int lastIndexOf(Object element) { if (useCache) { loadFromStore(); } else if (backingStore != null) { return backingStore.lastIndexOf(ownerSM, element); } return delegate.lastIndexOf(element); }
throws InvalidNodeTypeDefException, RepositoryException { for (Name nt : supertypes) { int pos = inheritanceChain.lastIndexOf(nt); if (pos >= 0) { StringBuilder buf = new StringBuilder();
throws InvalidNodeTypeDefException, RepositoryException { for (Name nt : supertypes) { int pos = inheritanceChain.lastIndexOf(nt); if (pos >= 0) { StringBuilder buf = new StringBuilder();
for (int i = 0; i < supertypes.length; i++) { Name stName = supertypes[i]; int pos = inheritanceChain.lastIndexOf(stName); if (pos >= 0) { StringBuffer buf = new StringBuffer();
int idx = seenStack.lastIndexOf(property); for (int i = idx; i < seenStack.size(); i++)
for (int i = 0; i < supertypes.length; i++) { Name stName = supertypes[i]; int pos = inheritanceChain.lastIndexOf(stName); if (pos >= 0) { StringBuffer buf = new StringBuffer();
ReferenceExp child = (ReferenceExp)itr.next(); int idx = items.lastIndexOf(child); if(idx!=-1) {
ReferenceExp child = (ReferenceExp)itr.next(); int idx = items.lastIndexOf(child); if(idx!=-1) {
ReferenceExp child = (ReferenceExp)itr.next(); int idx = items.lastIndexOf(child); if(idx!=-1) {
ReferenceExp child = (ReferenceExp)itr.next(); int idx = items.lastIndexOf(child); if(idx!=-1) {
int pos = definingParentNTs.lastIndexOf(nt); if (pos >= 0) { StringBuilder buf = new StringBuilder();
int pos = definingParentNTs.lastIndexOf(nt); if (pos >= 0) { StringBuilder buf = new StringBuilder();
for (int i = 0; i < childNodeNTs.length; i++) { Name nt = childNodeNTs[i]; int pos = definingParentNTs.lastIndexOf(nt); if (pos >= 0) { StringBuffer buf = new StringBuffer();