diff options
author | Sawyer Billings <sawpaw19@gmail.com> | 2020-12-30 21:49:12 -0500 |
---|---|---|
committer | fanquake <fanquake@gmail.com> | 2021-01-04 12:23:16 +0800 |
commit | e8640849c775efcf202dbd34736fed8d61379c49 (patch) | |
tree | 61f54fc033bdd157d33e6afd89a96c929592beb3 /src/support | |
parent | f52f427b8eece858844c395e47c378864acc242d (diff) |
doc: Use https URLs where possible
Diffstat (limited to 'src/support')
-rw-r--r-- | src/support/lockedpool.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/support/lockedpool.cpp b/src/support/lockedpool.cpp index 26de780f29..6965f40253 100644 --- a/src/support/lockedpool.cpp +++ b/src/support/lockedpool.cpp @@ -65,7 +65,7 @@ void* Arena::alloc(size_t size) // Pick a large enough free-chunk. Returns an iterator pointing to the first element that is not less than key. // This allocation strategy is best-fit. According to "Dynamic Storage Allocation: A Survey and Critical Review", - // Wilson et. al. 1995, http://www.scs.stanford.edu/14wi-cs140/sched/readings/wilson.pdf, best-fit and first-fit + // Wilson et. al. 1995, https://www.scs.stanford.edu/14wi-cs140/sched/readings/wilson.pdf, best-fit and first-fit // policies seem to work well in practice. auto size_ptr_it = size_to_free_chunk.lower_bound(size); if (size_ptr_it == size_to_free_chunk.end()) |