izderadicka

'''
Created on Nov 28, 2015

@author: ivan
'''


from datetime import date, timedelta
from copy import copy
import pprint

izderadicka

import matplotlib.pyplot as lpt
import numpy as np

def pt(data, point=None):
    p = plt.Polygon(data, closed=True, fill=None)
    ax = plt.gca()
    ax.add_patch(p)
    x=data[:,0]
    y=data[:,1]
    if point:

izderadicka

izderadicka

0x0004da82394ED7Aa756E6343F0A1a52609087d79

izderadicka

//! Simple module to implement [Sieve of Eratosthenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes).
//! It implements both clasical sieve (starting from 2 to given limit) and segmented sieve (from min to max).
//! # Examples
//!
//! Primes under 20:
//!
//! ```
//! use numbers::sieve::{Sieve,Eratosthenes};
//! let s = Eratosthenes::new(20);
//! assert_eq!(s.first(), Some(2));

izderadicka

#! /usr/bin/env python3

import argparse
import os
import subprocess
import logging
log = logging.getLogger()


def main():

izderadicka

#!/bin/bash

# Author : <Ivan Zderadicka> ivan@zderadicka.eu
# License: MIT
VERSION=0.1.1
BITRATE=48
CUTOFF=20000
APPLICATION=audio
FORMAT=opus
QUALITY=10

izderadicka

#[macro_use]
extern crate log;

use hyper::rt;
use hyper::server::Server;
use hyper::service::service_fn_ok;
use hyper::{Body, Request, Response};
use tokio::prelude::*;

mod ws;

izderadicka

#!/bin/bash
# Author : <Ivan Zderadicka> ivan@zderadicka.eu
# License: MIT


VERSION="0.2.3"
BITRATE=48
CUTOFF=12000
SEGMENT_TIME=1800
COMMON_PARAMS="-nostdin -v error"

izderadicka

use std::io::{self, Write, Seek};

pub struct Writer<W> {
    inner: W
}


impl <W:Write> Writer<WrapperUnseekable<W>> {
    pub fn new_unseekable(inner: W) -> Self {
        Writer{