| Anonymous | Login | Signup for a new account | 2013-06-18 08:31 CEST | ![]() |
| Main | My View | View Issues | Change Log | Roadmap |
| View Issue Details [ Jump to Notes ] | [ Issue History ] [ Print ] | ||||||||||
| ID | Project | Category | View Status | Date Submitted | Last Update | ||||||
| 0005826 | OCaml | OCaml standard library | public | 2012-11-15 00:14 | 2012-11-15 00:14 | ||||||
| Reporter | warwick | ||||||||||
| Assigned To | |||||||||||
| Priority | low | Severity | feature | Reproducibility | always | ||||||
| Status | new | Resolution | open | ||||||||
| Platform | OS | OS Version | |||||||||
| Product Version | |||||||||||
| Target Version | Fixed in Version | ||||||||||
| Summary | 0005826: List.take function | ||||||||||
| Description | I think it would be really good to add a function List.take : a' list -> int -> 'a list which could work similarly to List.nth except for returning a list of items up to and including the 'nth' one. This seems like a useful core function for the standard library rather than having to download an extension library to handle it. I'd find it most useful for finding the top 'n' items in a list: doing a List.sort followed by List.take Thanks for considering this request. | ||||||||||
| Tags | No tags attached. | ||||||||||
| Attached Files | |||||||||||
Issue History |
|||
| Date Modified | Username | Field | Change |
| 2012-11-15 00:14 | warwick | New Issue | |
| Copyright © 2000 - 2011 MantisBT Group |