def next_fit(self, value):
n = self.readbins[0]
c = self.readbins[1]
current = thebins.Bin()
for bin in self.bins:
current = bin
if current.sum + value <= c and len(self.bins) != 0:
current.append(value)
else:
bin = thebins.Bin()
bin.append(value)
self.bins.append(bin)
def first_fit(self, value):
n = self.readbins[0]
c = self.readbins[1]
for bin in self.bins:
if bin.sum + value <= c:
bin.append(value)
break
else:
bin = thebins.Bin()
bin.append(value)
self.bins.append(bin)
def worst_fit(self, value):
n = self.readbins[0]
c = self.readbins[1]
best = 0
k = 0
l = 0
for bin in self.bins:
if bin.sum + value <= c and (c - (bin.sum + value)) > best:
best = c - (bin.sum + value)
l = k
k = k + 1
if best != 0:
self.bins[l].append(value)
else:
bin = thebins.Bin()
bin.append(value)
self.bins.append(bin)