Home | History | Annotate | Download | only in stdlib

Lines Matching full:worst

99        are serviced via mmap(), where the worst case wastage is about
1841 The worst case number of steps to add, find, or remove a node is
5065 * Use best fit for very large chunks to prevent some worst-cases.