I don't know if it has been done. But to me it doesn't seem like it. (I haven't checked the latest version). Here is sample code in java http://pastebin.com/NWN0hdw6
The basic idea is to take a sample amount of lines (e.g. 100). - For each line - - Count the number of times each character occurs - Compute the "peakiness" for each characters occurrence over the lines. - Find the character with smallest peakiness. The idea is that the delimiter will occurs the same number of times on each line, and hence its peakiness will be 0 ideally. I'm just presenting this so perhaps someone will add this feature.
_______________________________________________ LibreOffice mailing list [email protected] http://lists.freedesktop.org/mailman/listinfo/libreoffice
