This is an archive of the discontinued Mercurial Phabricator instance.

Differential D7715

rust-discovery: type alias for random generator seed
ClosedPublic

Authored by gracinet on Dec 24 2019, 8:49 AM.

Details

Reviewers
Alphare
pulkit
Group Reviewers
hg-reviewers
Commits
rHG2abffea40700: rust-discovery: type alias for random generator seed
Summary

It just makes our life easier

Diff Detail

Repository
rHG Mercurial
Branch
default
Lint
No Linters Available
Unit
No Unit Test Coverage

Event Timeline

gracinet created this revision.Dec 24 2019, 8:49 AM
Alphare accepted this revision.Jan 3 2020, 4:57 AM
pulkit accepted this revision.Jan 9 2020, 9:22 AM
This revision is now accepted and ready to land.Jan 9 2020, 9:22 AM
gracinet added a commit: rHG2abffea40700: rust-discovery: type alias for random generator seed.Jan 9 2020, 9:56 AM
Closed by commit rHG2abffea40700: rust-discovery: type alias for random generator seed (authored by gracinet). · Explain Why
This revision was automatically updated to reflect the committed changes.

Revision Contents
Changeset List

PathPackages
Mrust/hg-core/src/discovery.rs (5 lines)

Diff 18923

rust/hg-core/src/discovery.rs

use super::{Graph, GraphError, Revision, NULL_REVISION}; use super::{Graph, GraphError, Revision, NULL_REVISION};
use crate::{ancestors::MissingAncestors, dagops, FastHashMap}; use crate::{ancestors::MissingAncestors, dagops, FastHashMap};
use rand::seq::SliceRandom; use rand::seq::SliceRandom;
use rand::{thread_rng, RngCore, SeedableRng}; use rand::{thread_rng, RngCore, SeedableRng};
use std::cmp::{max, min}; use std::cmp::{max, min};
use std::collections::{HashSet, VecDeque}; use std::collections::{HashSet, VecDeque};
type Rng = rand_pcg::Pcg32; type Rng = rand_pcg::Pcg32;
type Seed = [u8; 16];
pub struct PartialDiscovery<G: Graph + Clone> { pub struct PartialDiscovery<G: Graph + Clone> {
target_heads: Option<Vec<Revision>>, target_heads: Option<Vec<Revision>>,
graph: G, // plays the role of self._repo graph: G, // plays the role of self._repo
common: MissingAncestors<G>, common: MissingAncestors<G>,
undecided: Option<HashSet<Revision>>, undecided: Option<HashSet<Revision>>,
children_cache: Option<FastHashMap<Revision, Vec<Revision>>>, children_cache: Option<FastHashMap<Revision, Vec<Revision>>>,
missing: HashSet<Revision>, missing: HashSet<Revision>,
/// If `false`, a reproductible picking strategy is performed. This is /// If `false`, a reproductible picking strategy is performed. This is
/// useful for integration tests. /// useful for integration tests.
pub fn new( pub fn new(
graph: G, graph: G,
target_heads: Vec<Revision>, target_heads: Vec<Revision>,
respect_size: bool, respect_size: bool,
randomize: bool, randomize: bool,
) -> Self { ) -> Self {
let mut seed: [u8; 16] = [0; 16]; let mut seed = [0; 16];
if randomize { if randomize {
thread_rng().fill_bytes(&mut seed); thread_rng().fill_bytes(&mut seed);
} }
Self::new_with_seed(graph, target_heads, seed, respect_size, randomize) Self::new_with_seed(graph, target_heads, seed, respect_size, randomize)
} }
pub fn new_with_seed( pub fn new_with_seed(
graph: G, graph: G,
target_heads: Vec<Revision>, target_heads: Vec<Revision>,
seed: [u8; 16], seed: Seed,
respect_size: bool, respect_size: bool,
randomize: bool, randomize: bool,
) -> Self { ) -> Self {
PartialDiscovery { PartialDiscovery {
undecided: None, undecided: None,
children_cache: None, children_cache: None,
target_heads: Some(target_heads), target_heads: Some(target_heads),
graph: graph.clone(), graph: graph.clone(),