ttsort

function jage( v, t, x )
    if math.abs( v.max_dmg - v.dmg - t.dmg )
        > math.abs( v.max_dmg - v.dmg - x.dmg ) then
        return true
    else
        return false
    end
end

function AllDrop()
    for i = 1, 16 do
        if turtle.getItemCount(i) > 0 then
            -- turtle.select(i)
            -- turtle.dropUp()
            chest.pullItem("down",i)
        end
    end
    turtle.select(1)
end

chest = peripheral.wrap("top")
if chest then
    while true do
        local list = chest.getAllStacks()
        for k, v in pairs(list) do
            if v.all().max_dmg == 0 or v.all().dmg == 0 then
                chest.pushItem("up",k)
                list[k].out = "out"
            end
        end

        for k, v in pairs(list) do
            if v.all().raw_name ~= "" then
                local targetN = -1
                for l, x in pairs(list) do
                    if k < l and v.all().raw_name == x.all().raw_name and not v.out and not x.out then
                        -- if targetN == -1 then
                        --  targetN = l
                        -- elseif jage(v,list[targetN],x) then
                        --  targetN = l
                        -- end
                        targetN = l
                        break
                    end
                end

                if targetN ~= -1 then
                    -- write("("..k..","..targetN.. ")")
                    AllDrop()
                    chest.pushItem("down",k)
                    chest.pushItem("down",targetN)
                    turtle.craft()
                    AllDrop()
                    list[k].out = "out"
                    list[targetN].out = "out"
                    sleep(1)
                end
            end
        end

        sleep(1)
    end
else
    write("need 2 chest on turtle\nC\nC\nT\n")
end