Vladimir Panteleev 6caa5fa19a std.container.rbtree: Add trisect (#10756) ... Useful in case we need >= or <= (instead of > or < or = as provided by lowerBound/upperBound/equalRange). Same convention as SortedRange.trisect, except just return a static array instead of a tuple (as the type is the same).		2025-04-20 07:29:02 +08:00
..
array.d	Fix import	2023-11-06 17:50:20 +00:00
binaryheap.d	Better document the use of Heaps with Dynamic Array as Store (#8677)	2023-02-09 13:55:44 +01:00
dlist.d	[std.container DList docs] Fix time complexity of insertFront etc	2025-02-17 17:48:13 +01:00
package.d	Fix D-Scanner linting issues (#9070)	2024-10-27 01:21:56 -07:00
rbtree.d	std.container.rbtree: Add trisect (#10756)	2025-04-20 07:29:02 +08:00
slist.d	Fix D-Scanner linting issues (#9070)	2024-10-27 01:21:56 -07:00
util.d	Fix D-Scanner linting issues (#9070)	2024-10-27 01:21:56 -07:00