A Quick Comparison of Nim vs. Rust

Re:A Quick Comparison of Nim vs. Rust by tikue_ on Wednesday January 14, 2015 @03:51AM (#8885050)

Also seems like you could benefit from the entry() api (available on both BTreeMap and HashMap):

http://doc.rust-lang.org/std/collections/struct.BTreeMap.htm...

I think the example used in the docs is your exact use case.

This bit:

  let found = match map.get_mut(..) {
    ..
  }
  if !found {
    ..
  }

can be replaced with

  match map.entry(word) {
      Occupied(mut view) => { *view.get_mut() += 1; }
      Vacant(view) => { view.insert(1); }
  }

[ Parent | on HN ]

Re:A Quick Comparison of Nim vs. Rust by arthurtw on Wednesday January 14, 2015 @04:50AM (#8885266)

Good point! I’ve updated the article accordingly. I learned the Entry thing a few months ago, but Rust’s BTreeMap did not support the entry API at that time, so my code did not use it. Then I totally forgot about it when writing this blog...

[ Parent | on HN ]