var searchIndex = {};
searchIndex["utils"] = {"doc":"","items":[[5,"noise_walk","utils","Ported implementation of `_slang_library_noise1()` for our generic noise walk!",null,{"inputs":[{"name":"f"}],"output":{"name":"f"}}],[0,"epsilon","","",null,null],[5,"epsilon","utils::epsilon","A helper function for bypassing the Epsilon trait's namespace where\nthe Epsilon type can be inferred.",null,{"inputs":[],"output":{"name":"f"}}],[8,"Epsilon","","A trait for finding the smallest fraction possible with a given Float type.",null,null],[10,"epsilon","","Return the difference between 1 and the next lowest value that follows 1.",0,{"inputs":[],"output":{"name":"self"}}],[0,"factorisation","utils","",null,null],[5,"is_factor","utils::factorisation","Check if the queried value is a factor of num.",null,{"inputs":[{"name":"i"},{"name":"i"}],"output":{"name":"bool"}}],[5,"are_any_factors","","Check if any of the queried values are a factor of num.",null,null],[5,"are_all_factors","","Check if all of the queried values are a factor of num.",null,null],[5,"is_prime","","Is the number prime?",null,{"inputs":[{"name":"i"}],"output":{"name":"bool"}}],[5,"lowest_non_one","","Return the lowest non-one factor.",null,{"inputs":[{"name":"i"}],"output":{"name":"option"}}],[5,"get_all_factors","","Get all factors for 'n'.",null,{"inputs":[{"name":"i"}],"output":{"name":"vec"}}],[0,"fps","utils","",null,null],[3,"Fps","utils::fps","A signal that returns delta time at a rate so that\nthere are `fps` frames per seconds.",null,null],[6,"DeltaSecs","","",null,null],[11,"clone","","",1,null],[11,"new","","Construct a new Fps struct with a maximum `frames_per_sec`.",1,{"inputs":[{"name":"f64"}],"output":{"name":"fps"}}],[11,"high_priority","","A builder method for constructing a high priority Fps signal.\nThis will consume more cpu but will result in a far more accurate frame rate.",1,null],[11,"frame_ns","","Return the time since the last frame.",1,null],[11,"get_dt_ns","","Return the dt in nanoseconds for the given t in nanoseconds",1,null],[11,"next","","",1,null],[0,"iter","utils","",null,null],[0,"sample_on","utils::iter","",null,null],[3,"Items","utils::iter::sample_on","Iterator returned from the `sample_on` method.",null,null],[8,"SampleOn","","Sample from the current iterator every time an iteration occurs on another iterator.\nThis is primarily used for binding an iterator to another timed iterator. i.e.\n`(0..1000).sample_on(Fps::new(60.0))`.",null,null],[11,"sample_on","","",2,null],[11,"infinite","","Construct a never-ending signal.",3,null],[11,"next","","",3,null],[0,"math","utils","",null,null],[5,"clamp","utils::math","Clamp a value to a range.",null,{"inputs":[{"name":"t"},{"name":"t"},{"name":"t"}],"output":{"name":"t"}}],[5,"fmod","","Models the CPP fmod function.",null,{"inputs":[{"name":"f"},{"name":"f"}],"output":{"name":"f"}}],[5,"in_range","","Check if value is in range.",null,{"inputs":[{"name":"t"},{"name":"t"},{"name":"t"}],"output":{"name":"bool"}}],[5,"lerp","","Interpolate from start to stop 'amt' amount.",null,{"inputs":[{"name":"f"},{"name":"f"},{"name":"f"}],"output":{"name":"f"}}],[5,"map_range","","Map a value from a given range to a new given range.",null,{"inputs":[{"name":"x"},{"name":"x"},{"name":"x"},{"name":"y"},{"name":"y"}],"output":{"name":"y"}}],[5,"remainder","","Models the CPP remainder function.",null,{"inputs":[{"name":"f"},{"name":"f"}],"output":{"name":"f"}}],[5,"modulo","","The modulo function.",null,{"inputs":[{"name":"i"},{"name":"i"}],"output":{"name":"i"}}],[5,"wrap","","Wrap value to a range.",null,{"inputs":[{"name":"f"},{"name":"f"},{"name":"f"}],"output":{"name":"f"}}],[5,"sigmoid","","The logistic aka sigmoid function.",null,{"inputs":[{"name":"f"}],"output":{"name":"f"}}],[0,"signal","utils","",null,null],[3,"Signal","utils::signal","Signal generic struct for simplifying dsp signal generation.\nSignal should be able to handle any floating point primitive.",null,null],[12,"val","","The main value. If Signal were to be plotted on a cartesian\nplane, this value would be 'x' for which we will solve 'y'.",4,null],[12,"bez_depth","","Depth of the bezier curve.",4,null],[12,"freq","","Frequency of the signal.",4,null],[12,"amp","","Amplitude of the signal.",4,null],[11,"decode","","",4,{"inputs":[{"name":"__df"}],"output":{"name":"result"}}],[11,"encode","","",4,null],[11,"fmt","","",4,null],[11,"clone","","",4,null],[11,"new","","Constructor for Signal",4,{"inputs":[{"name":"f"}],"output":{"name":"signal"}}],[11,"set_val","","Set value for which you will return signal (get_sin/cos/sqr/saw) etc...",4,null],[11,"set_gradient","","If you woudl like to return the signal value on a slope, set gradient here.",4,null],[11,"set_freq","","Set frequency of signal.",4,null],[11,"set_amp","","Set amplitude of signal.",4,null],[11,"set_bez_depth","","Set depth of bezier curve. Defaults to 0.",4,null],[11,"get_bezier","","Get signal with bezier curve.",4,null],[11,"get_result","","Get oscillator with amplitude and bezier.",4,null],[11,"get_sin","","Get sine wave signal result at val.",4,null],[11,"get_cos","","Get cosine wave signal result at val.",4,null],[11,"get_saw","","Get saw wave signal result at val.",4,null],[11,"get_sqr","","Get square wave signal result at val.",4,null],[11,"get_noise","","Get noise signal result at val.",4,null],[11,"get_noise_walk","","Ported implementation of `_slang_library_noise1()`\nfor our generic noise walk!",4,null],[0,"vec","utils","",null,null],[8,"TakeOnly","utils::vec","Take only the elements that return `true` from the given condition.",null,null],[10,"take_only","","Take only the elements that return `true` from the given condition.",5,null],[14,"chain!","utils","A macro used to simplify chaining together multiple `IntoIter` types.",null,null]],"paths":[[8,"Epsilon"],[3,"Fps"],[8,"SampleOn"],[3,"Items"],[3,"Signal"],[8,"TakeOnly"]]};
initSearch(searchIndex);