/** * {@inheritDoc} */ @Override public Iterable<IoBuffer> getIoBuffers() { if (bas.isEmpty()) { return Collections.emptyList(); } Collection<IoBuffer> result = new ArrayList<>(); Node node = bas.getFirst(); for (IoBuffer bb : node.getByteArray().getIoBuffers()) { result.add(bb); } while (node.hasNextNode()) { node = node.getNextNode(); for (IoBuffer bb : node.getByteArray().getIoBuffers()) { result.add(bb); } } return result; }
/** * {@inheritDoc} */ @Override public Iterable<IoBuffer> getIoBuffers() { if (bas.isEmpty()) { return Collections.emptyList(); } Collection<IoBuffer> result = new ArrayList<>(); Node node = bas.getFirst(); for (IoBuffer bb : node.getByteArray().getIoBuffers()) { result.add(bb); } while (node.hasNextNode()) { node = node.getNextNode(); for (IoBuffer bb : node.getByteArray().getIoBuffers()) { result.add(bb); } } return result; }
/** * @inheritDoc */ public Iterable<IoBuffer> getIoBuffers() { if ( bas.isEmpty() ) { return Collections.emptyList(); } Collection<IoBuffer> result = new ArrayList<>(); Node node = bas.getFirst(); for ( IoBuffer bb : node.getByteArray().getIoBuffers() ) { result.add( bb ); } while ( node.hasNextNode() ) { node = node.getNextNode(); for ( IoBuffer bb : node.getByteArray().getIoBuffers() ) { result.add( bb ); } } return result; }
componentNode = componentNode.getNextNode(); if ( listener != null )
componentNode = componentNode.getNextNode();
componentNode = componentNode.getNextNode();
/** * @inheritDoc */ public void order( ByteOrder order ) { if ( order == null || !order.equals( this.order ) ) { this.order = order; if ( !bas.isEmpty() ) { for ( Node node = bas.getFirst(); node.hasNextNode(); node = node.getNextNode() ) { node.getByteArray().order( order ); } } } }
/** * {@inheritDoc} */ @Override public void order(ByteOrder order) { if (order == null || !order.equals(this.order)) { this.order = order; if (!bas.isEmpty()) { for (Node node = bas.getFirst(); node.hasNextNode(); node = node.getNextNode()) { node.getByteArray().order(order); } } } }
/** * {@inheritDoc} */ @Override public void order(ByteOrder order) { if (order == null || !order.equals(this.order)) { this.order = order; if (!bas.isEmpty()) { for (Node node = bas.getFirst(); node.hasNextNode(); node = node.getNextNode()) { node.getByteArray().order(order); } } } }
/** * Returns the first node in the byte array * * @return * */ public Node getFirst() { return header.getNextNode(); }
/** * @return the first node in the byte array */ public Node getFirst() { return header.getNextNode(); }
/** * Removes the first node from this list * * @return * The node that was removed */ public Node removeFirst() { Node node = header.getNextNode(); firstByte += node.ba.last(); return removeNode(node); }
/** * @return the first node in the byte array */ public Node getFirst() { return header.getNextNode(); }
/** * Removes the first node from this list * * @return * The node that was removed */ public Node removeFirst() { Node node = header.getNextNode(); firstByte += node.ba.last(); return removeNode( node ); }
/** * Removes the first node from this list * * @return * The node that was removed */ public Node removeFirst() { Node node = header.getNextNode(); firstByte += node.ba.last(); return removeNode(node); }