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/api_response/mod.rs:6:26: 6:41 error: failed to resolve. Did you mean `self::rustc_serialize`? [E0433] | |
src/api_response/mod.rs:6 #[derive(RustcEncodable, RustcDecodable)] | |
^~~~~~~~~~~~~~~ | |
src/api_response/mod.rs:6:26: 6:40 note: in this expansion of #[derive_RustcDecodable] (defined in src/api_response/mod.rs) | |
src/api_response/mod.rs:6:26: 6:41 help: run `rustc --explain E0433` to see a detailed explanation | |
src/api_response/mod.rs:6:26: 6:40 error: use of undeclared trait name `rustc_serialize::Decodable` [E0405] | |
src/api_response/mod.rs:6 #[derive(RustcEncodable, RustcDecodable)] | |
^~~~~~~~~~~~~~ | |
src/api_response/mod.rs:6:26: 6:40 note: in this expansion of #[derive_RustcDecodable] (defined in src/api_response/mod.rs) | |
src/api_response/mod.rs:6:26: 6:40 help: run `rustc --explain E0405` to see a detailed explanation |
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
tyger42@ubuntu:~/code/clients/waypoint/geotif_converter/Deliver2$ cat Mosaic_0_0.tfw | |
0.026000 | |
0.000000 | |
0.000000 | |
-0.026000 | |
495550.263000 | |
1272772.475000 |
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
Driver: GTiff/GeoTIFF | |
Files: Mosaic_0_0.tif | |
Size is 2057, 3403 | |
Coordinate System is `' | |
Origin = (495550.250000000000000,1272772.488000000128523) | |
Pixel Size = (0.026000000000000,-0.026000000000000) | |
Metadata: | |
TIFFTAG_RESOLUTIONUNIT=1 (unitless) | |
TIFFTAG_SOFTWARE=SimActive Inc. | |
Image Structure Metadata: |
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 iron; | |
use iron::prelude::*; | |
use iron::{BeforeMiddleware, typemap}; | |
use std::io::prelude::*; | |
use std::fs::File; | |
use std::fs::OpenOptions; | |
pub struct RequestLog; |
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; | |
use self::num::traits::{Num, Zero, One, Signed, Unsigned, Bounded, Saturating, CheckedAdd, CheckedSub, CheckedMul, CheckedDiv, PrimInt, Float, ToPrimitive, FromPrimitive, NumCast} | |
pub fn number_of_factors<T: Num + Zero + One + Signed + Unsigned + Bounded + Saturating + CheckedAdd + CheckedSub + CheckedMul + CheckedDiv + PrimInt + Float + ToPrimitive + FromP | |
let one = 1 as T; | |
let zero = 0 as T; | |
let mut factor_count: T = one; | |
let mut limit = n; | |
let mut i: T = one; | |
while i < limit { |
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; | |
use self::num::traits::{Num, Zero, One, Signed, Unsigned, Bounded, Saturating, CheckedAdd, CheckedSub, CheckedMul, CheckedDiv, PrimInt, Float, ToPrimitive, FromPrimitive, NumCast} | |
pub fn number_of_factors<T: Num + Zero + One + Signed + Unsigned + Bounded + Saturating + CheckedAdd + CheckedSub + CheckedMul + CheckedDiv + PrimInt + Float + ToPrimitive + FromP | |
let one = 1 as T; | |
let zero = 0 as T; | |
let mut factor_count: T = one; | |
let mut limit = n; | |
let mut i: T = one; | |
while i < limit { |