bookowl / type-inference Goto Github PK
View Code? Open in Web Editor NEWHindley Milner Type Inference in Rust
License: The Unlicense
Hindley Milner Type Inference in Rust
License: The Unlicense
error[E0034]: multiple applicable items in scope
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/graph_impl/stable_graph/mod.rs:1172:19
|
1172 | self.iter.find_map(|(i, node)| {
| ^^^^^^^^ multiple find_map
found
|
note: candidate #1 is defined in an impl of the trait IterUtilsExt
for the type I
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/iter_utils.rs:5:5
|
5 | / fn find_map<F, R>(&mut self, mut f: F) -> Option
6 | | where F: FnMut(Self::Item) -> Option
| |_______________________________________________^
= note: candidate #2 is defined in an impl of the trait Iterator
for the type Enumerate<I>
help: disambiguate the associated function for candidate #1
|
1172 | IterUtilsExt::find_map(&mut self.iter, |(i, node)| {
1173 | node.weight.as_ref().map(move |w| (node_index(i), w))
1174 | })
|
help: disambiguate the associated function for candidate #2
|
1172 | Iterator::find_map(&mut self.iter, |(i, node)| {
1173 | node.weight.as_ref().map(move |w| (node_index(i), w))
1174 | })
|
error[E0034]: multiple applicable items in scope
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/graph_impl/stable_graph/mod.rs:1355:19
|
1355 | self.iter.find_map(|(i, edge)|
| ^^^^^^^^ multiple find_map
found
|
note: candidate #1 is defined in an impl of the trait IterUtilsExt
for the type I
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/iter_utils.rs:5:5
|
5 | / fn find_map<F, R>(&mut self, mut f: F) -> Option
6 | | where F: FnMut(Self::Item) -> Option
| |_______________________________________________^
= note: candidate #2 is defined in an impl of the trait Iterator
for the type Enumerate<I>
help: disambiguate the associated function for candidate #1
|
1355 | IterUtilsExt::find_map(&mut self.iter, |(i, edge)|
1356 | edge.weight.as_ref().map(move |weight| {
1357 | EdgeReference {
1358 | index: edge_index(i),
1359 | node: edge.node,
1360 | weight: weight,
...
help: disambiguate the associated function for candidate #2
|
1355 | Iterator::find_map(&mut self.iter, |(i, edge)|
1356 | edge.weight.as_ref().map(move |weight| {
1357 | EdgeReference {
1358 | index: edge_index(i),
1359 | node: edge.node,
1360 | weight: weight,
...
error[E0034]: multiple applicable items in scope
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/graph_impl/stable_graph/mod.rs:1519:19
|
1519 | self.iter.find_map(|(i, node)| {
| ^^^^^^^^ multiple find_map
found
|
note: candidate #1 is defined in an impl of the trait IterUtilsExt
for the type I
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/iter_utils.rs:5:5
|
5 | / fn find_map<F, R>(&mut self, mut f: F) -> Option
6 | | where F: FnMut(Self::Item) -> Option
| |_______________________________________________^
= note: candidate #2 is defined in an impl of the trait Iterator
for the type Enumerate<I>
help: disambiguate the associated function for candidate #1
|
1519 | IterUtilsExt::find_map(&mut self.iter, |(i, node)| {
1520 | if node.weight.is_some() {
1521 | Some(node_index(i))
1522 | } else { None }
1523 | })
|
help: disambiguate the associated function for candidate #2
|
1519 | Iterator::find_map(&mut self.iter, |(i, node)| {
1520 | if node.weight.is_some() {
1521 | Some(node_index(i))
1522 | } else { None }
1523 | })
|
error[E0034]: multiple applicable items in scope
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/graph_impl/stable_graph/mod.rs:1565:19
|
1565 | self.iter.find_map(|(i, node)| {
| ^^^^^^^^ multiple find_map
found
|
note: candidate #1 is defined in an impl of the trait IterUtilsExt
for the type I
--> /home/yuyang/.cargo/registry/src/github.com-1ecc6299db9ec823/petgraph-0.4.9/src/iter_utils.rs:5:5
|
5 | / fn find_map<F, R>(&mut self, mut f: F) -> Option
6 | | where F: FnMut(Self::Item) -> Option
| |_______________________________________________^
= note: candidate #2 is defined in an impl of the trait Iterator
for the type Enumerate<I>
help: disambiguate the associated function for candidate #1
|
1565 | IterUtilsExt::find_map(&mut self.iter, |(i, node)| {
1566 | if node.weight.is_some() {
1567 | Some(edge_index(i))
1568 | } else { None }
1569 | })
|
help: disambiguate the associated function for candidate #2
|
1565 | Iterator::find_map(&mut self.iter, |(i, node)| {
1566 | if node.weight.is_some() {
1567 | Some(edge_index(i))
1568 | } else { None }
1569 | })
|
error: aborting due to 4 previous errors
For more information about this error, try rustc --explain E0034
.
error: could not compile petgraph
To learn more, run the command again with --verbose.
warning: build failed, waiting for other jobs to finish...
error: build failed
> fun c -> c c
thread 'main' has overflowed its stack
fatal runtime error: stack overflow
It's not as clean, but it will allow this project to work on stable.
Right now letrec allows stuff like (letrec x = x + 1 in x) : int
which doesn't make sense.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.