Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Preparing release. #1355

Merged
merged 2 commits into from
Oct 6, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion bindings/node/Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
authors = ["Nicolas Patry <[email protected]>"]
edition = "2021"
name = "node"
version = "0.14.1-dev.0"
version = "0.14.2-dev.0"

# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html

Expand Down
7 changes: 3 additions & 4 deletions bindings/node/index.d.ts
Original file line number Diff line number Diff line change
Expand Up @@ -175,7 +175,7 @@ export class Encoding {
getSequenceIds(): Array<number | undefined | null>
tokenToSequence(token: number): number | null
}
export class Model { }
export class Model {}
export type Bpe = BPE
export class BPE {
static empty(): Model
Expand Down Expand Up @@ -204,7 +204,7 @@ export class Normalizer {
export class PreTokenizer {
preTokenizeString(sequence: string): [string, [number, number]][]
}
export class Processor { }
export class Processor {}
export class AddedToken {
constructor(token: string, isSpecial: boolean, options?: AddedTokenOptions | undefined | null)
getContent(): string
Expand All @@ -229,7 +229,6 @@ export class Tokenizer {
decodeBatch(ids: Array<Array<number>>, skipSpecialTokens: boolean): Promise<string[]>
static fromString(s: string): Tokenizer
static fromFile(file: string): Tokenizer
// static fromPretrained(file: string, parameters?: JsFromPretrainedParameters | undefined | null): Tokenizer
addSpecialTokens(tokens: Array<string>): void
setTruncation(maxLength: number, options?: TruncationOptions | undefined | null): void
disableTruncation(): void
Expand All @@ -251,4 +250,4 @@ export class Tokenizer {
addSpecialTokens?: boolean | undefined | null,
): Encoding
}
export class Trainer { }
export class Trainer {}
4 changes: 2 additions & 2 deletions bindings/python/Cargo.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
[package]
name = "tokenizers-python"
version = "0.14.1-dev.0"
version = "0.14.2-dev.0"
authors = ["Anthony MOI <[email protected]>"]
edition = "2021"

Expand All @@ -21,7 +21,7 @@ onig = { version = "6.4", default-features = false }
itertools = "0.11"

[dependencies.tokenizers]
version = "0.14.1-dev.0"
version = "0.14.2-dev.0"
path = "../../tokenizers"

[dev-dependencies]
Expand Down
2 changes: 1 addition & 1 deletion tokenizers/Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
authors = ["Anthony MOI <[email protected]>", "Nicolas Patry <[email protected]>"]
edition = "2018"
name = "tokenizers"
version = "0.14.1-dev.0"
version = "0.14.2-dev.0"
homepage = "https://github.com/huggingface/tokenizers"
repository = "https://github.com/huggingface/tokenizers"
documentation = "https://docs.rs/tokenizers/"
Expand Down
25 changes: 13 additions & 12 deletions tokenizers/src/models/bpe/trainer.rs
Original file line number Diff line number Diff line change
Expand Up @@ -21,17 +21,17 @@ impl PartialEq for Merge {
}
impl PartialOrd for Merge {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
if self.count != other.count {
Some(self.count.cmp(&other.count))
} else {
// Here we want ascending order
Some(other.pair.cmp(&self.pair))
}
Some(self.cmp(other))
}
}
impl Ord for Merge {
fn cmp(&self, other: &Self) -> Ordering {
self.partial_cmp(other).unwrap()
if self.count != other.count {
self.count.cmp(&other.count)
} else {
// Here we want ascending order
other.pair.cmp(&self.pair)
}
}
}

Expand Down Expand Up @@ -533,15 +533,16 @@ impl BpeTrainer {
let changes = top
.pos
.maybe_par_iter()
.flat_map(|i| {
let w = &words[*i] as *const _ as *mut _;
.flat_map(|&i| {
let word = &words[i] as *const _ as *mut Word;
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@ArthurZucker Let's keep track of this. The newer compiler raised the casting of &Word to &mut Word as undefined behavior (meaning they can break it whenever they want).

Here I'm just keeping the raw pointer instead which works. But maybe things start breaking from this at some point.

// We can merge each of these words in parallel here because each position
// can be there only once (HashSet). So this is safe.
unsafe {
let word: &mut Word = &mut (*w);
word.merge(top.pair.0, top.pair.1, new_token_id, max_token_length)
// let word: &mut Word = &mut (*word);
(*word)
.merge(top.pair.0, top.pair.1, new_token_id, max_token_length)
.into_iter()
.map(|c| (c, *i))
.map(|c| (c, i))
.collect::<Vec<_>>()
}
})
Expand Down
12 changes: 6 additions & 6 deletions tokenizers/src/models/bpe/word.rs
Original file line number Diff line number Diff line change
Expand Up @@ -20,17 +20,17 @@ impl PartialOrd for Merge {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
// By manually implementing this, we make the containing BinaryHeap a
// min-heap ordered first on the rank, and the pos otherwise
if self.rank != other.rank {
Some(other.rank.cmp(&self.rank))
} else {
Some(other.pos.cmp(&self.pos))
}
Some(self.cmp(other))
}
}

impl Ord for Merge {
fn cmp(&self, other: &Self) -> Ordering {
self.partial_cmp(other).unwrap()
if self.rank != other.rank {
other.rank.cmp(&self.rank)
} else {
other.pos.cmp(&self.pos)
}
}
}

Expand Down
2 changes: 1 addition & 1 deletion tokenizers/src/models/unigram/trie.rs
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@ impl<Label: Eq + Hash + Copy> Trie<Label> {
pub fn push(&mut self, element: &[Label]) {
let mut node = &mut self.root;
for label in element.iter() {
node = node.children.entry(*label).or_insert_with(Node::default);
node = node.children.entry(*label).or_default();
}
node.is_leaf = true;
}
Expand Down
Loading