Suyash suyash

## mixture_density_nets_2d.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                suyash
                / mixture_density_nets_2d.ipynb
            
            
              Last active
              October 6, 2019 04:56
            
              
                Mixture Density Nets 2D
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## segment_tree.rs
//! Generic Segment Tree implemented for custom comparator and min functions.
//!
//! See Chapters 15, 16 in Blandy and Orendorff

/// Segment Tree allows for querying information over ranges in a continuous data stream.
pub struct SegmentTree<T, Comparator, Minimum> {
    tree: Vec<T>,
    n: usize,
    f: Comparator,
    d: Minimum,

## kmp.rs
//! Knuth-Morris-Pratt implementation
//!
//! See Chapter 17 in Blandy + Orendorff

/// computes the KMP longest prefix-suffix function
pub fn kmp<T: AsRef<[u8]>>(pattern: T) -> Vec<usize> {
    let pattern = pattern.as_ref();
    let n = pattern.len();
    let mut ans = vec![0; n + 1];
	//! Generic Segment Tree implemented for custom comparator and min functions.
	//!
	//! See Chapters 15, 16 in Blandy and Orendorff

	/// Segment Tree allows for querying information over ranges in a continuous data stream.
	pub struct SegmentTree<T, Comparator, Minimum> {
	tree: Vec<T>,
	n: usize,
	f: Comparator,
	d: Minimum,
	//! Knuth-Morris-Pratt implementation
	//!
	//! See Chapter 17 in Blandy + Orendorff

	/// computes the KMP longest prefix-suffix function
	pub fn kmp<T: AsRef<[u8]>>(pattern: T) -> Vec<usize> {
	let pattern = pattern.as_ref();
	let n = pattern.len();
	let mut ans = vec![0; n + 1];