@Test public void testContains() { assertFalse(newInsnList().contains(new InsnNode(0))); }
public boolean contains(final AbstractInsnNode insnNode) { AbstractInsnNode currentInsn = firstInsn; while (currentInsn != null && currentInsn != insnNode) { currentInsn = currentInsn.nextInsn; } return currentInsn != null; }
InsnList { public boolean contains(final AbstractInsnNode insnNode) { AbstractInsnNode currentInsn = firstInsn; while (currentInsn != null && currentInsn != insnNode) { currentInsn = currentInsn.nextInsn; } return currentInsn != null; } }
InsnList { public boolean contains(final AbstractInsnNode insnNode) { AbstractInsnNode currentInsn = firstInsn; while (currentInsn != null && currentInsn != insnNode) { currentInsn = currentInsn.nextInsn; } return currentInsn != null; }  }
InsnList { public boolean contains(final AbstractInsnNode insnNode) { AbstractInsnNode currentInsn = firstInsn; while (currentInsn != null && currentInsn != insnNode) { currentInsn = currentInsn.nextInsn; } return currentInsn != null; }  int size(); AbstractInsnNode getFirst(); AbstractInsnNode getLast(); AbstractInsnNode get(final int index); boolean contains(final AbstractInsnNode insnNode); int indexOf(final AbstractInsnNode insnNode); void accept(final MethodVisitor methodVisitor); ListIterator<AbstractInsnNode> iterator(); @SuppressWarnings("unchecked") ListIterator<AbstractInsnNode> iterator(final int index); AbstractInsnNode[] toArray(); void set(final AbstractInsnNode oldInsnNode, final AbstractInsnNode newInsnNode); void add(final AbstractInsnNode insnNode); void add(final InsnList insnList); void insert(final AbstractInsnNode insnNode); void insert(final InsnList insnList); void insert(final AbstractInsnNode previousInsn, final AbstractInsnNode insnNode); void insert(final AbstractInsnNode previousInsn, final InsnList insnList); void insertBefore(final AbstractInsnNode nextInsn, final AbstractInsnNode insnNode); void insertBefore(final AbstractInsnNode nextInsn, final InsnList insnList); void remove(final AbstractInsnNode insnNode); void clear(); void resetLabels(); }
InsnList { public boolean contains(final AbstractInsnNode insnNode) { AbstractInsnNode currentInsn = firstInsn; while (currentInsn != null && currentInsn != insnNode) { currentInsn = currentInsn.nextInsn; } return currentInsn != null; }  int size(); AbstractInsnNode getFirst(); AbstractInsnNode getLast(); AbstractInsnNode get(final int index); boolean contains(final AbstractInsnNode insnNode); int indexOf(final AbstractInsnNode insnNode); void accept(final MethodVisitor methodVisitor); ListIterator<AbstractInsnNode> iterator(); @SuppressWarnings("unchecked") ListIterator<AbstractInsnNode> iterator(final int index); AbstractInsnNode[] toArray(); void set(final AbstractInsnNode oldInsnNode, final AbstractInsnNode newInsnNode); void add(final AbstractInsnNode insnNode); void add(final InsnList insnList); void insert(final AbstractInsnNode insnNode); void insert(final InsnList insnList); void insert(final AbstractInsnNode previousInsn, final AbstractInsnNode insnNode); void insert(final AbstractInsnNode previousInsn, final InsnList insnList); void insertBefore(final AbstractInsnNode nextInsn, final AbstractInsnNode insnNode); void insertBefore(final AbstractInsnNode nextInsn, final InsnList insnList); void remove(final AbstractInsnNode insnNode); void clear(); void resetLabels();  }