GitHub Badges

EbTech · EbTech · commit 7b0dbd6bd7e1 · 2021-02-03T01:45:24.000-08:00
diff --git a/README.md b/README.md
@@ -1,7 +1,11 @@
 # Contest Algorithms in Rust
 
+[![Crates.io Version](https://img.shields.io/crates/v/contest-algorithms.svg)](https://crates.io/crates/contest-algorithms)
+[![Documentation](https://docs.rs/contest-algorithms/badge.svg)](https://docs.rs/contest-algorithms)
+[![license](https://img.shields.io/badge/license-MIT-blue.svg)](https://github.com/bevyengine/bevy/blob/master/LICENSE)
+[![Crates.io Downloads](https://img.shields.io/crates/d/contest-algorithms.svg)](https://crates.io/crates/contest-algorithms)
 [![Build Status](https://travis-ci.org/EbTech/rust-algorithms.svg?branch=master)](https://travis-ci.org/EbTech/rust-algorithms)
-[![Latest Version](https://img.shields.io/crates/v/contest-algorithms.svg)](https://crates.io/crates/contest-algorithms)
+[![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)
 
 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.
 
diff --git a/src/range_query/dynamic_arq.rs b/src/range_query/dynamic_arq.rs
@@ -68,8 +68,10 @@ impl<T: ArqSpec> DynamicArq<T> {
     /// Builds a tree whose leaves are set to a given non-empty slice.
     pub fn build_from_slice(&mut self, init_val: &[T::S]) -> ArqView {
         if init_val.len() == 1 {
-            let mut root = DynamicArqNode::default();
-            root.val = init_val[0].clone();
+            let root = DynamicArqNode {
+                val: init_val[0].clone(),
+                ..Default::default()
+            };
             self.nodes.push(root);
             (self.nodes.len() - 1, 1)
         } else {
@@ -85,8 +87,10 @@ impl<T: ArqSpec> DynamicArq<T> {
     pub fn merge_equal_sized(&mut self, (lp, ls): ArqView, (rp, rs): ArqView) -> ArqView {
         assert!(ls == rs || ls + 1 == rs);
         let p = self.nodes.len();
-        let mut root = DynamicArqNode::default();
-        root.down = (lp, rp);
+        let root = DynamicArqNode {
+            down: (lp, rp),
+            ..Default::default()
+        };
         self.nodes.push(root);
         self.pull(p);
         (p, ls + rs)
