public int previous() throws NoSuchElementException { return table[iter.previous()] & 0xff; }
public int previous() throws NoSuchElementException { return table[iter.previous()] & 0xff; }
public int previous() { if (offset == 0) { throw new NoSuchElementException(); } offset--; return iter.previous(); }
public int previous() { if (start == 0) throw new NoSuchElementException(); return iter.previous(); }
public int previous() throws NoSuchElementException { final int seek = seekPrevious(); if (seek == -1) throw new NoSuchElementException(); final int previous = iterators[seek].previous(); index--; return previous; }
public int previous() { if (! hasPrevious()) throw new NoSuchElementException(); offset--; return iter.previous(); }
public int previous() throws NoSuchElementException { if (! hasPrevious()) throw new NoSuchElementException(); if (lo) { lo = false; iter.previous(); return hex(b >> 4); } else { b = iter.peekPrevious(); lo = true; return hex(b & 0xf); } }
switch (state) { case 0x21: { iter.previous(); // skip and fall through iter.previous(); // skip and fall through iter.previous(); // skip and fall through iter.previous(); // skip and fall through int b4 = iter.previous(); int b3 = iter.previous(); int b2 = iter.previous(); int b1 = iter.previous(); int b0 = iter.previous(); c0 = calc0(b0); c1 = calc1(b0, b1);
@Override public int peekType() throws ASN1Exception { long currOffset = bi.getIndex(); int tag = readTag(); while ((bi.getIndex() != currOffset) && bi.hasPrevious()) { bi.previous(); } return tag; }
private void readTag(int expectedTag) throws ASN1Exception { if (implicitTag != -1) { expectedTag = implicitTag | (expectedTag & CONSTRUCTED_MASK); implicitTag = -1; } long currOffset = bi.getIndex(); int actualTag = readTag(); if (actualTag != expectedTag) { while ((bi.getIndex() != currOffset) && bi.hasPrevious()) { bi.previous(); } throw log.asnUnexpectedTag(); } }
private boolean hasCompleteElement() { boolean hasNext; long currOffset = bi.getIndex(); try { readTag(); int length = readLength(); int i; for (i = 0; (i < length) && bi.hasNext(); i++) { bi.next(); } hasNext = (i == length); } catch (ASN1Exception e) { hasNext = false; } while ((bi.getIndex() != currOffset) && bi.hasPrevious()) { bi.previous(); } return hasNext; }
@Override public byte[] drainElement() throws ASN1Exception { if (implicitTag != -1) { implicitTag = -1; } long currOffset = bi.getIndex(); readTag(); int valueLength = readLength(); int length = (int) ((bi.getIndex() - currOffset) + valueLength); while ((bi.getIndex() != currOffset) && bi.hasPrevious()) { bi.previous(); } byte[] element = new byte[length]; if ((length != 0) && (bi.drain(element) != length)) { throw log.asnUnexpectedEndOfInput(); } return element; }
public int previous() { if (offset == 0) { throw new NoSuchElementException(); } offset--; return iter.previous(); }
public int previous() { if (! hasPrevious()) throw new NoSuchElementException(); offset--; return iter.previous(); }
public int previous() throws NoSuchElementException { final int seek = seekPrevious(); if (seek == -1) throw new NoSuchElementException(); final int previous = iterators[seek].previous(); index--; return previous; }
public int previous() { if (! hasPrevious()) throw new NoSuchElementException(); offset--; return iter.previous(); }
public int previous() throws NoSuchElementException { if (! hasPrevious()) throw new NoSuchElementException(); if (lo) { lo = false; iter.previous(); return hex(b >> 4); } else { b = iter.peekPrevious(); lo = true; return hex(b & 0xf); } }
@Override public int peekType() throws ASN1Exception { long currOffset = bi.getIndex(); int tag = readTag(); while ((bi.getIndex() != currOffset) && bi.hasPrevious()) { bi.previous(); } return tag; }