| Commit message (Collapse) | Author | Age | Files | Lines |
| | |
|
| |
|
|
| |
easier packaging
|
| |
|
|
| |
Removes compression support
|
| |
|
|
|
|
| |
That completes the set. I do think it's possible to bum a few more
cycles from the implementation, but, I'm not going to. It passes
the acceptance suite and that's what it needs to do.
|
| |
|
|
|
| |
Hopefully I can talk users out of taking advantage of this configuration
but I'll have better luck with that if it's available.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
These create reverse or forward iterators before or after a Word. So
this way, the user can get the word at an index, then iterate forward
or back from that word.
Also:
Fixes #59
Which was fixed awhile back, but I don't feel like doing repo surgery
to tag the fix where it happened. We have blame for that kind of
thing.
|
| |
|
|
|
|
| |
In keeping with the new nomenclature, we're calling the module "Words",
not "WordBreak". The latter is Unicode jargon, the module provides word
iterators. Words are the figure, word breaks are the ground.
|
| | |
|
| |\ |
|
| | |
| |
| |
| | |
Closes #53
|
| | |
| |
| |
| |
| |
| |
| |
| |
| | |
I removed the initAtIndex functions from the public vocabulary, because
the last couple of days of sweat and blood prove that it's hard to use
correctly.
That's probably it for WordBreak, now to fix the overlong bug on v0.14
and get this integrated with the new reverse grapheme iterator.
|
| | | |
|
| | |
| |
| |
| |
| | |
The handling of ignorables is really different, because they 'adhere'
to the future of the iteration, not the past.
|
| | |
| |
| |
| |
| | |
After fixing a bug in Runicode which was fenceposting codepoints off the
end of ranges. As one does.
|
| | |
| |
| |
| |
| | |
I'm not sure the details of this strategy can actually be made to work.
But, something can.
|
| |/
|
|
|
|
|
| |
The comments in WordBreak and SentenceBreak tests get really long, the
provided buffer would be inadequate. So this just provides a sub-
iterator which will strip comments and comment lines, while keeping an
eye on line numbers for any debugging.
|
| |
|
|
|
|
|
| |
Lets me slip these in:
Closes #12
Closes #14
|
| |
|
|
|
|
|
|
|
|
| |
These turned up an excessive amount of allocations in CanonData and
CompatData, which have been reduced to two through the somewhat
squirrely use of 'magic numbers'.
There are now allocation tests for every allocated structure in the
library, and they run to completion in a reasonable amount of time.
So, that's nice.
|
| | |
|
| | |
|
| |
|
|
|
| |
In the process of refactoring the whole library, so that it doesn't
expose anything called "Data" separately from user functionality.
|
| |
|
|
| |
methods were removed, mem.Allocators were added to deinit as arguments.
|
| |
|
|
|
| |
This does the expected thing: returns the next ?Grapheme without
mutation of the iteration state.
|
| | |
|
| |
|
|
| |
issues.
|
| |
|