Bug 9887 – std.array.insertOrdered?

Status
NEW
Severity
enhancement
Priority
P4
Component
phobos
Product
D
Version
D2
Platform
All
OS
All
Creation time
2013-04-05T16:19:24Z
Last change time
2024-12-01T16:17:17Z
Assigned to
No Owner
Creator
bearophile_hugs
Moved to GitHub: phobos#9968 →

Comments

Comment #0 by bearophile_hugs — 2013-04-05T16:19:24Z
This is a way to insert an item in a sorted array: import std.stdio: writeln; import std.range: assumeSorted; import std.array: insertInPlace; void main() { int[] arr = [0, 10, 20, 30, 40, 50, 60, 70, 80, 90]; int x = 35; arr.insertInPlace(arr.assumeSorted.lowerBound(x).length, x); arr.writeln; } Haskell has the insert/insertBy functions (for lists): http://zvon.org/other/haskell/Outputlist/insertBy_f.html http://zvon.org/other/haskell/Outputlist/insert_f.html It's an operation not too much rare, and implementing it correctly like I have shown is not immediate, there is a little risk of introducing a bug. So is it worth adding such small function std.array.insertOrdered() to std.array?
Comment #1 by robert.schadek — 2024-12-01T16:17:17Z
THIS ISSUE HAS BEEN MOVED TO GITHUB https://github.com/dlang/phobos/issues/9968 DO NOT COMMENT HERE ANYMORE, NOBODY WILL SEE IT, THIS ISSUE HAS BEEN MOVED TO GITHUB