@Test public void testInsert_illegalArgument() { InsnList insnList = newInsnList(); newInsnList(insn1, insn2); Executable insert = () -> insnList.insert(insn1); assertThrows(IllegalArgumentException.class, insert); }
public void insert(final AbstractInsnNode insnNode) { ++size; if (firstInsn == null) { firstInsn = insnNode; lastInsn = insnNode; } else { firstInsn.previousInsn = insnNode; insnNode.nextInsn = firstInsn; } firstInsn = insnNode; cache = null; insnNode.index = 0; }
InsnList { public void insert(final AbstractInsnNode insnNode) { ++size; if (firstInsn == null) { firstInsn = insnNode; lastInsn = insnNode; } else { firstInsn.previousInsn = insnNode; insnNode.nextInsn = firstInsn; } firstInsn = insnNode; cache = null; insnNode.index = 0; } }
InsnList { public void insert(final AbstractInsnNode insnNode) { ++size; if (firstInsn == null) { firstInsn = insnNode; lastInsn = insnNode; } else { firstInsn.previousInsn = insnNode; insnNode.nextInsn = firstInsn; } firstInsn = insnNode; cache = null; insnNode.index = 0; }  }
InsnList { public void insert(final AbstractInsnNode insnNode) { ++size; if (firstInsn == null) { firstInsn = insnNode; lastInsn = insnNode; } else { firstInsn.previousInsn = insnNode; insnNode.nextInsn = firstInsn; } firstInsn = insnNode; cache = null; insnNode.index = 0; }  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 void insert(final AbstractInsnNode insnNode) { ++size; if (firstInsn == null) { firstInsn = insnNode; lastInsn = insnNode; } else { firstInsn.previousInsn = insnNode; insnNode.nextInsn = firstInsn; } firstInsn = insnNode; cache = null; insnNode.index = 0; }  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();  }