    @Test
    public void testDuplicateInsert()
            throws Exception, IOException, MiniDBException{

        BPlusTree bt = createCommonTree(false);
        bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, "12")), 12L);
        bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, "120")), 0L);
        bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, "9")), 254L);
        bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, "12 ")), 13L);
        bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, "12 ")), 15L);
        bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, "9")), 255L);
        try{
            bt.insertPair(new ArrayList<>(Arrays.asList(100, 200.0, new String(new char[120]))), 255L);
            throw new Exception("wrong!");
        }catch (MiniDBException e)
        {
        }
        assertSearchEqual(bt, new ArrayList<>(Arrays.asList(100, 200.0, "9")), new Long[]{255L, 254L});
        assertSearchEqual(bt, new ArrayList<>(Arrays.asList(100, 200.0, "120")), new Long[]{0L});
        assertSearchEqual(bt, new ArrayList<>(Arrays.asList(100, 200.0, "12")), new Long[]{12L, 13L, 15L});
        assertSearchEqual(bt, new ArrayList<>(Arrays.asList(100, 200.0, "xs")), new Long[]{});
//        bt.commitTree();
    }