Guide I am following:
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
lb := 0 | |
rb := 0 | |
SetMouseDelay,0 | |
LButton:: | |
Click down | |
lb := 1 | |
return |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
src/math.rs:328:45: 328:61 error: no method named `pointwise_mul` found for type `iter::Shaped<iter::SparseMap<iter::SparseIntersection<vec::IntoSparseIter<u32>, vec::IntoSparseIter<u32>>, Box<core::ops::FnMut((u32, u32)) -> u32 + 'static>>>` in the current scope | |
src/math.rs:328 let a = a.clone().pointwise_mul(a.clone()).pointwise_mul(a); | |
^~~~~~~~~~~~~~~~ | |
src/math.rs:328:45: 328:61 note: the method `pointwise_mul` exists but the following trait bounds were not satisfied: `iter::Shaped<iter::SparseMap<iter::SparseIntersection<vec::IntoSparseIter<u32>, vec::IntoSparseIter<u32>>, Box<core::ops::FnMut((u32, u32)) -> u32>>> : math::GetValueIter`, `iter::Shaped<iter::SparseMap<iter::SparseIntersection<vec::IntoSparseIter<u32>, vec::IntoSparseIter<u32>>, Box<core::ops::FnMut((u32, u32)) -> u32>>> : math::SparseSparseOps<_>`, `iter::Shaped<iter::SparseMap<iter::SparseIntersection<vec::IntoSparseIter<u32>, vec::IntoSparseIter<u32>>, Box<core::ops::FnMut((u32 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
diff --git a/f90nml/parser.py b/f90nml/parser.py | |
index 687de10..7fb42d7 100644 | |
--- a/f90nml/parser.py | |
+++ b/f90nml/parser.py | |
@@ -75,25 +75,39 @@ class Parser(object): | |
>>> parser = Parser() | |
>>> data_nml = parser.read('data.nml')""" | |
- nml_file = open(nml_fname, 'r') | |
+ nml_is_file = hasattr(nml_fname, 'read') |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
extern crate num_integer; | |
extern crate num_traits; | |
use num_integer::Integer; | |
use num_traits::{PrimInt,Signed,Zero,One}; | |
#[derive(Copy,Clone,Debug,Eq,PartialEq)] | |
pub struct GcdData<X> { | |
// greatest common divisor | |
pub gcd: X, | |
// least common multiple |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:SyntasticInfo | |
Syntastic version: 3.7.0-180 (Vim 704, Linux) | |
Info for filetype: rust | |
Global mode: active | |
Passive filetypes: asm python | |
Filetype rust is active | |
The current file will be checked automatically | |
Available checker: rustc | |
Currently enabled checker: rustc |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use serde; | |
use serde::de::Deserialize; | |
use serde_json as json; | |
use std::collections::BTreeSet; | |
use itertools::Itertools; | |
use ::util::MyIteratorExt; | |
use ::layers::{Layers,Layer}; | |
use ::ruleset::traits::RuleSet; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- | @'sieveFactor' fs n@ finds the prime factorisation of @n@ using the 'FactorSieve' @fs@. | |
-- For negative @n@, a factor of @-1@ is included with multiplicity @1@. | |
-- After stripping any present factors @2@, the remaining cofactor @c@ (if larger | |
-- than @1@) is factorised with @fs@. This is most efficient of course if @c@ does not | |
-- exceed the bound with which @fs@ was constructed. If it does, trial division is performed | |
-- until either the cofactor falls below the bound or the sieve is exhausted. In the latter | |
-- case, the elliptic curve method is used to finish the factorisation. | |
sieveFactor :: FactorSieve -> Integer -> [(Integer,Int)] | |
sieveFactor (FS bnd sve) = check | |
where |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#![feature(step_by)] | |
#![feature(test)] | |
pub extern crate test; | |
use test::Bencher; | |
// Using a segmented sieve method for factorization. | |
// This has a couple of speed advantages that are not possible to offer | |
// currently through the abstractions present in my `factor` crate. |
Notes about my setup:
- IHaskell repo was cloned to
~/build/IHaskell
- notebook root (and
cabal.sandbox.config
) is at~/ihaskell/
. - sandbox is at
~/ihaskell/sandbox/.cabal-sandbox
. (I relocated it as part of a misguided attempt to reduce the number of instances of "an add-source dependency has updated")
As I noted in the issue:
- The Docker image works fine.
- But I do not use it because I want to install more packages.
- Dynamic linking also fixes the error
OlderNewer