Robert Watson <rwatson_at_FreeBSD.org> writes: > - Some appliations behave poorly with large trees. ls(1) is the classic > example -- sorting 150,000 strings is expensive, and should be avoided. That's because fts's sorting code is brain-dead. It starts by reading the entire directory into a linked list, then copies that list into an array which it passes to qsort(), and finally converts the array back into a linked list. DES -- Dag-Erling Smørgrav - des_at_des.noReceived on Wed Jun 08 2005 - 05:25:57 UTC
This archive was generated by hypermail 2.4.0 : Wed May 19 2021 - 11:38:36 UTC