Commit 7b0dbd6

committed

GitHub Badges

1 parent f7e1f71 commit 7b0dbd6Copy full SHA for 7b0dbd6

File tree

+13

-5

lines changed

+13

-5

lines changed

Lines changed: 5 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,11 @@`
`1`	`1`	`# Contest Algorithms in Rust`
`2`	`2`
	`3`	`+[![Crates.io Version](https://img.shields.io/crates/v/contest-algorithms.svg)](https://crates.io/crates/contest-algorithms)`
	`4`	`+[![Documentation](https://docs.rs/contest-algorithms/badge.svg)](https://docs.rs/contest-algorithms)`
	`5`	`+[![license](https://img.shields.io/badge/license-MIT-blue.svg)](https://github.com/bevyengine/bevy/blob/master/LICENSE)`
	`6`	`+[![Crates.io Downloads](https://img.shields.io/crates/d/contest-algorithms.svg)](https://crates.io/crates/contest-algorithms)`
`3`	`7`	`[![Build Status](https://travis-ci.org/EbTech/rust-algorithms.svg?branch=master)](https://travis-ci.org/EbTech/rust-algorithms)`
`4`		`-[![Latest Version](https://img.shields.io/crates/v/contest-algorithms.svg)](https://crates.io/crates/contest-algorithms)`
	`8`	`+[![Gitter](https://badges.gitter.im/rust-algos/community.svg)](https://gitter.im/rust-algos/community?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge)`
`5`	`9`
`6`	`10`	`A collection of classic data structures and algorithms, emphasizing usability, beauty and clarity over full generality. As such, this should be viewed not as a blackbox library, but as a whitebox cookbook demonstrating the design and implementation of algorithms. I hope it will be useful to students and educators, as well as fans of algorithmic programming contests.`
`7`	`11`

Lines changed: 8 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -68,8 +68,10 @@ impl<T: ArqSpec> DynamicArq<T> {`
`68`	`68`	`/// Builds a tree whose leaves are set to a given non-empty slice.`
`69`	`69`	`pub fn build_from_slice(&mut self, init_val: &[T::S]) -> ArqView {`
`70`	`70`	`if init_val.len() == 1 {`
`71`		`- let mut root = DynamicArqNode::default();`
`72`		`- root.val = init_val[0].clone();`
	`71`	`+ let root = DynamicArqNode {`
	`72`	`+ val: init_val[0].clone(),`
	`73`	`+ ..Default::default()`
	`74`	`+ };`
`73`	`75`	`self.nodes.push(root);`
`74`	`76`	`(self.nodes.len() - 1, 1)`
`75`	`77`	`} else {`
`@@ -85,8 +87,10 @@ impl<T: ArqSpec> DynamicArq<T> {`
`85`	`87`	`pub fn merge_equal_sized(&mut self, (lp, ls): ArqView, (rp, rs): ArqView) -> ArqView {`
`86`	`88`	`assert!(ls == rs \|\| ls + 1 == rs);`
`87`	`89`	`let p = self.nodes.len();`
`88`		`- let mut root = DynamicArqNode::default();`
`89`		`- root.down = (lp, rp);`
	`90`	`+ let root = DynamicArqNode {`
	`91`	`+ down: (lp, rp),`
	`92`	`+ ..Default::default()`
	`93`	`+ };`
`90`	`94`	`self.nodes.push(root);`
`91`	`95`	`self.pull(p);`
`92`	`96`	`(p, ls + rs)`

Comments

(0)