Add graphemeAtIndex + iterate before and after

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.

1 files changed, 2 insertions, 2 deletions

diff --git a/src/Words.zig b/src/Words.zig
index 1707881..af82562 100644
--- a/src/Words.zig
+++ b/src/Words.zig
@@ -124,12 +124,12 @@ pub fn reverseIterator(words: *const Words, slice: []const u8) ReverseIterator {
 }
 
 /// Returns an iterator after the `word` in `slice`.
-pub fn iterateAfter(words: *const Words, slice: []const u8, word: Word) Iterator {
+pub fn iterateAfterWord(words: *const Words, slice: []const u8, word: Word) Iterator {
     return forwardFromIndex(words, slice, word.offset + word.len);
 }
 
 /// Returns a reverse iterator before the `word` in `slice`.
-pub fn iterateBefore(words: *const Words, slice: []const u8, word: Word) ReverseIterator {
+pub fn iterateBeforeWord(words: *const Words, slice: []const u8, word: Word) ReverseIterator {
     return reverseFromIndex(words, slice, word.offset);
 }