diff options
| author | Izzy Swart <zenerboson@gmail.com> | 2020-08-06 16:13:29 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-08-06 16:13:29 -0700 |
| commit | b809f453cac600acef9de5fedb457f842563266c (patch) | |
| tree | b3d61fb59d782d5d36f757fa663fe46b38398f82 | |
| parent | 0d75c91def02555b6932c457e63dd999ec58e319 (diff) | |
| download | rust-b809f453cac600acef9de5fedb457f842563266c.tar.gz rust-b809f453cac600acef9de5fedb457f842563266c.zip | |
Fix typo "biset" -> "bitset"
| -rw-r--r-- | src/tools/unicode-table-generator/src/main.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/tools/unicode-table-generator/src/main.rs b/src/tools/unicode-table-generator/src/main.rs index eabbcee9d73..d2d1807b3bb 100644 --- a/src/tools/unicode-table-generator/src/main.rs +++ b/src/tools/unicode-table-generator/src/main.rs @@ -15,7 +15,7 @@ //! We have two separate encoding schemes: a skiplist-like approach, and a //! compressed bitset. The datasets we consider mostly use the skiplist (it's //! smaller) but the lowercase and uppercase sets are sufficiently sparse for -//! the bitset to be worthwhile -- for those sets the biset is a 2x size win. +//! the bitset to be worthwhile -- for those sets the bitset is a 2x size win. //! Since the bitset is also faster, this seems an obvious choice. (As a //! historical note, the bitset was also the prior implementation, so its //! relative complexity had already been paid). |
