15 ms·
Option Monads in Rust
- wyager 12y agoAm I wrong in thinking this is using Option as a functor, and not a monad? Edit: looks like rust's and_then() is similar to bind, so it's reasonable to call this monadic.
- tel 12y ago.map() is the functor interface and .and_then() is the monad one.
- gamegoblin 12y agoEDIT: This is wrong I initially thought the same thing, due to the use of `map` as something of an equivalent of the Haskell `bind` (>>=) operator. It reminded me of just using `fmap`. But no, they are using it as a full monad. Consider the type of fmap: Functor f => (a -> b) -> f a -> f b and the type of (>>=) Monad m => m a -> (a -> m b) -> m b The key difference is the function argument. In a Functor, the argument is (a -> b), but in a Monad, it's (a -> m b). The distinction is that when you `fmap` a function over a `Just` value (`Some` in Rust), you always get back a `Just` value, but when you bind a `Maybe` value into a function, you might get back a `Nothing`. So don't let Rust's use of `map` deceive you -- it seems to be the same as (>>=). That being said, I'd be interested to see Rust introduce something akin to do-notation syntactic sugar. ======= EDIT: I am wrong, the `map` function is basically equivalent to `fmap` and it seems the `and_then` function is similar to (>>=). See user tel and user wyager's responses.
- TheHydroImpulse 12y agoCurrently, it's impossible to introduce a generic `Monad` trait (the same with `Functor`) because we're missing Higher-kinded types. Once Rust has such a type system extension, it'll be possible to introduce some monadic sugar.
- pcwalton 12y agoNote that you could have monadic sugar via macros today; it'd just be duck-typed, not strongly-typed.
- wyager 12y agoBut rust's map() is fmap. All the functions used with map() are a->a. It looks like and_then() is more equivalent to >>=.
- gamegoblin 12y agoAaaah I misunderstood -- I thought they'd made the type signatures for all of their math functions to return an Option type. You are totally correct.
- gamegoblin 12y agoAs a Haskell programmer and a casual Rust observer (yet to take the dive), I am constantly impressed with the nice balance Rust seems to have struck between Haskell and C. Currently my #1 and #2 languages are Haskell and C. I will definitely jump on the Rust bandwagon with the 1.0 release -- maybe sooner, we'll see.
- bsaul 12y agoAs a "many things except haskell ( yet to take a dive) and pure C" developper, i am also extremely eager to try Rust once the 1.0 is out. One painful point i've seen so far is pointer semantics, but it seems pretty much like the only one, and after having read a slidedeck explaining the reason behind them i'm feeling even more excited.
- tel 12y agoWhat's the pain point of Rust's pointer semantics from the POV of a C programmer? I'm genuinely quite interested—especially given that Rust's pointer semantics is one of their major innovations.
- mackwic 12y agoHaving done a (simple, but non-trivial) memcached implementation in Rust, the pointer semantic is terrible right now. The compiler tracks all the use of the values and assign them lifetimes. These lifetimes are tagged from a special form of use (value, mutable value, reference, mutable reference, and some more). The idea of Rust memory-safety is to totally forbid two simultaneous mutable lifetime whatever the code path could be. Whatever the code path could be. Do you begin to realize how strong this assumption is ? Yes, the rust compiler is smart. But sometimes, it's not enough and you have to do the lifetime tracking job by yourself. It's awfully hard (even without recursion). But you know what's even harder ? When all the common code patterns you are aware of for a given task doesn't provide enough warranty for the rust compiler. You know what you want to do. It's indeed very simple (can be an inner swap in some sort of algorithm) but you can't find a way to warranty the compiler that all should be good. Because in its own sort of bizarre logic, it makes sense. Then you're trapped. And you are waiting on #rust@irc.mozilla.org an hint from the bunch of truly marvelous guys who pass their time here. TLDR: Rust can't express 100% what others languages do (ML or C based). And in the portion where it can, you have to do a lot of gymnastic to make it compile. And our Memcached, you'll ask ? Well. After 6 days of work, we finally make it compile, and it worked quite fine. But then we got some mysterious tasking errors when reaching 20 clients and gave up at this point.
- kazinator 12y agoExact dupe: https://news.ycombinator.com/item?id=8184300 https://news.ycombinator.com/item?id=8184300
- dang 12y agoReposts are ok when a post hasn't had significant attention in about a year: https://news.ycombinator.com/newsfaq.html https://news.ycombinator.com/newsfaq.html. 15 points is a fair bit of attention, but 0 comments not so much, so I think this repost is ok.
- agapos 12y agoThat one doesn't seem to be a year old, but the lack of comments make this bump reasonable IMO.
- dang 12y agoI fear that what I wrote wasn't clear. The rule about significant attention only applies to stories that are less than a year old. After a year or so, reposts are typically ok.
- Tomte 12y agoAren't submissions folded to the last one, if the URL is the same? I could swear I have seen that even when the prior submission was a few years old. Does the algorithm to decide that take comment activity into account?
- dang 12y agoThe algorithm doesn't currently take the time of submission or number of comments into account, but we're working on a new implementation that will handle all of this.
- carterschonwald 12y agoI'm really excited that PCWalton got some basic associated types support into Rust in time for the 1.0 milestone, that plus post 1.0 HKT (higher kinded traits/types) will make Rust a really compelling language for building amazing libraries :) with those in place, some really beautiful api technology becomes possible to port to Rust. I really appreciate that the core dev team has those partly underway, and partly planned for the post 1.0 stuff.
- tetha 12y agoNow do one about either. Given Java 8 and Optional, I recently used Either to replace 80 something lines of crazy interconnected try-catch-bullstuff in a server with 4 straight either-based lines, "do this, in good case try this, in good case try that, ... and finally send a good result to the client, or log a bad result and send the error to the client". Had to rework and introduce some methods to make this work, of course, but those methods turned into try { foo = doWork(); return Either.goodResult( foo ); } catch ( Exception e ) { return Either.badResult(e); }. It's structured, and neat, and readable. :)
- Dewie 12y agoEither is called Result in Rust.
- innguest 12y agoThat's a terrible name - they should change it to Either. We always call things "result" in code, but I've never called a variable "either". That's why I think Either is a better name - it's less likely to clash with valid names.
- Dewie 12y agoI agree with you on that. "Either" suggests 'either this or that', to me. "Result" feels too generic. Any value can be called a 'result'. Though I don't know what the reasoning is on the naming of that type; for all I know it might make a lot of sense within the context of rust and be very much in line with the conventions of the rest of the standard library.
- dbaupp 12y agoResult is essentially trying to only be an error-handling technique, its two variants are Ok and Err (less generic than Left/Right). I believe the 'Result' name actually comes from OCaml. Rust used also to have an isomorphic type called Either, but error handling was found to be by far the most common use of these two types, so it was decided to standardise on a single one with obvious variant names (i.e. it's clear with Ok/Err which one is the error and which one is the real value, while Either requires getting the Left/Right convention right).
- 1_player 12y agoI don't understand the second example: fn some_on_even(val: int) -> Option<int> { match val { // Matches an even number. even if even % 2 == 0 => Some(even), // Matches anything else. _ => None } } Where is even coming from? Is that a typo, or that construct is actually defining a variable even from val if val % 2 == 0 ? That seems absurdly confusing to me.
- dbaupp 12y agoIt's binding a variable `even`, and then using a pattern guard to conditionally take that arm depending on the value of `even`; it's (basically) the same as match val { even => { if even % 2 == 0 { Some(even) } else { None } } _ => None } which is an absurd construct (and the example pretty absurd too). It should be written as just if val % 2 == 0 { Some(val) } else { None } or, if you really like the formatting a match provides, just avoid creating a new name binding match () { _ if val % 2 == 0 => Some(val), _ => None } `match` and pattern guards make far more sense when not just binding directly to a single variable like that, e.g. let val: Option<int> = ...; match val { // even Some(x) if x % 2 == 0 => Some(x), // odd Some(x) => Some(x + 1), None => None } (Of course this may still be clearer using `.map` instead `match` but it's a better example than the original one.)
- yawaramin 12y agoTo answer your question, it's the latter. That's what pattern matching is, basically.
- ww520 12y agoMatch has the syntax of: match value { pattern(variable-binding) [if guard-condition] => matched result ... } In this case, the first 'even' is variable declaration binding it to val. The next 'if even % 2 == 0' is the guard expression, qualifying the range of values of the 'even' variable. The 'if' is a keyword, indicating a guard expression. The next '=> Some(even)' returns an Option type wrapping the matching 'even' values. The wildcard _ matches whatever left, which is the non-even values of val.
- omaranto 12y agoThere's a typo in the title, it should say "Option Monad in Rust".
- millstone 12y agoThe "Symphony of Functions" example is worth dissecting, since it's a good example of when NOT to use an Option monad. The code computes sqrt(-1 * (log(-1 * (20 * 2)))^2). The potentially failing functions are log and sqrt. Failure is determined by checking if the result is a "normal" floating point value. But 'double' and 'square' may also produce non-normal values, e.g. squaring a large float may produce infinity. So why doesn't double() return an Option as well? Furthermore, checking if a value is normal is not correct. If x slightly exceeds 1, then log x is a small positive value, i.e. a denormal, and therefore log() will incorrectly report failure. Floating point arithmetic already has a serviceable "Option" type in its non-finite values (NaN and infinities), so the best way to write this code is the naive way: let result: f64 = sqrt(pow(-1 * (log(-1 * (20 * 2))), 2)); let success: bool = is_finite(result); The Option monad only makes this code longer, slower, and buggier.
- SamReidHughes 12y ago> If x slightly exceeds 1, then log x is a small positive value, i.e. a denormal, and therefore log() will incorrectly report failure. No it won't, for the neighboring values of 1, which are 1-2^-53 and 1+2^-52, log will return approximately -2^-53 and 2^-52, which are not denormal.
- hoverbear 12y agoIt was a challenge to come up with a good example for the section without utilizing too much of a language that is unfamiliar to most of the readers. I'm debating changing it to a string parsing example. Do you think it would be more appropriate of a use? Or is there a better concept to demonstrate?