nyinyithann

#![feature(core_intrinsics)]

fn print_type_of<T>(_: &T) {
    println!("{}", unsafe { std::intrinsics::type_name::<T>() });
}

nyinyithann

/* Counter example can be seen at https://doc.rust-lang.org/std/iter/index.html#implementing-iterator
   I just wanna try out implementing Iterator trait on tuple like struct.
   Due to the IntoIterator blanket implementation in standard library - "impl<I: Iterator> IntoIterator for I" , 
   all Iterator can be treated like IntoIterator. That's why we can call c.into_iter() in the code.
*/
use std::iter::*;

fn main() {
    let mut z = 0u32;
    let ref mut c = Counter(&mut z);

nyinyithann

use std::collections::HashMap;

fn main() {
    let mut router = BasicRouter::new();
    router.add_route("/", |req| Response {
        code: 200,
        headers: req.headers.clone(),
        body: vec![1, 2, 3, 4, 5],
    });

nyinyithann

/*
    To implement a trait on a type, the trait or the type has to be local to the code you work on. It is called the orphan rule.
    To get around this restriction, we can use the newtype pattern which involves creating a new type in a tuple struct.
    Both Vec<T> and Display trait are from the standard library and neither is local to our code.
    We are not able to implement Display trait to Vec<T>. But we can construct a wrapper type holding an instance of Vec<T> and implement Display trait on it.
    In the following example, VecWrapper<T> struct wraps Vec<T> and implements Display trait.
    To get all the methods of Vec<T> available to VecWrapper, Deref trait is implemented on it.

    ref: https://doc.rust-lang.org/book/ch19-03-advanced-traits.html?search=borrow%20and%20asref
*/