Date: prev next · Thread: first prev next last
2012 Archives by date, by thread · List index


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.

Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.