aboutsummaryrefslogtreecommitdiff
path: root/src/passwordmaker/mod.rs
diff options
context:
space:
mode:
authorAndreas Grois <andi@grois.info>2022-11-04 21:31:36 +0100
committerAndreas Grois <andi@grois.info>2022-11-04 21:31:36 +0100
commitc385c90148178ad38b17491d45f5dcc2cbe06c9c (patch)
tree73d80a5875523dee4a0bd98ebcb3b6f9bb0603bf /src/passwordmaker/mod.rs
parent36b7ec5ea805196749c7f10f1d8e03ae03564f2b (diff)
Remove obsolete comment about base conversion.
It's done, so no point in keeping the TODO around :D
Diffstat (limited to 'src/passwordmaker/mod.rs')
-rw-r--r--src/passwordmaker/mod.rs3
1 files changed, 0 insertions, 3 deletions
diff --git a/src/passwordmaker/mod.rs b/src/passwordmaker/mod.rs
index c9ec1e3..405d469 100644
--- a/src/passwordmaker/mod.rs
+++ b/src/passwordmaker/mod.rs
@@ -224,9 +224,6 @@ enum GetGraphemesIteratorInner {
struct GetGraphemesIterator<'a> {
graphemes : &'a Vec<Grapheme<'a>>,
inner : GetGraphemesIteratorInner
- //There really should be a better solution than storing those values. If we had arbitrary-length multiplication and subtraction maybe?
- //like, finding the highest potence of divisor that still is smaller than the dividend, and dividing by that one to get the left-most digit,
- //dividing the remainder of this operation by the next-lower potence of divisor to get the second digit, and so on?
}
impl<'a> Iterator for GetGraphemesIterator<'a> {