Timeline for Printing unique lines
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2020 at 0:56 | comment | added | jhnc | Some versions of sort (eg. GNU coreutils) use temporary files and external mergesort if the input is too big to fit in RAM. And most other versions have a -m option so this can be done explicitly by chunking the input (eg. with split), sorting each chunk, and then merging the chunks | |
| Oct 2, 2017 at 16:18 | answer | added | Sarfraaz Ahmed | timeline score: 1 | |
| Mar 24, 2011 at 13:27 | vote | accept | Šimon Tóth | ||
| Mar 23, 2011 at 13:46 | comment | added | Šimon Tóth | @gabe Not requiring the entire file to be stored in memory for example. | |
| Mar 23, 2011 at 13:31 | comment | added | gabe. | What do you mean by "better"? | |
| Mar 23, 2011 at 3:23 | answer | added | Jonathan Leffler | timeline score: 0 | |
| Mar 22, 2011 at 23:31 | history | tweeted | twitter.com/#!/StackUnix/status/50338849540407296 | ||
| Mar 22, 2011 at 23:06 | answer | added | Gilles 'SO- stop being evil' | timeline score: 40 | |
| Mar 22, 2011 at 22:42 | answer | added | Mat | timeline score: 4 | |
| Mar 22, 2011 at 22:29 | history | asked | Šimon Tóth | CC BY-SA 2.5 |