Erosion and dilasion by square successfully tested.
[Faustine.git] / documentation / code_VALValue.normalize.html
1 <html><head>
2 <link rel="stylesheet" href="style.css" type="text/css">
3 <meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
4 <link rel="Start" href="index.html">
5 <link title="Index of types" rel=Appendix href="index_types.html">
6 <link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
7 <link title="Index of values" rel=Appendix href="index_values.html">
8 <link title="Index of modules" rel=Appendix href="index_modules.html">
9 <link title="Types" rel="Chapter" href="Types.html">
10 <link title="Parser" rel="Chapter" href="Parser.html">
11 <link title="Lexer" rel="Chapter" href="Lexer.html">
12 <link title="Value" rel="Chapter" href="Value.html">
13 <link title="Signal" rel="Chapter" href="Signal.html">
14 <link title="Faustexp" rel="Chapter" href="Faustexp.html">
15 <link title="Interpreter" rel="Chapter" href="Interpreter.html">
16 <link title="Preprocess" rel="Chapter" href="Preprocess.html">
17 <link title="Main" rel="Chapter" href="Main.html"><title>Value.normalize</title>
18 </head>
19 <body>
20 <code class="code"><span class="keyword">let</span>&nbsp;<span class="keyword">rec</span>&nbsp;normalize&nbsp;v&nbsp;=&nbsp;<br>
21 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">let</span>&nbsp;n&nbsp;=&nbsp;2.&nbsp;**&nbsp;float_of_int&nbsp;(value_macro_to_int&nbsp;<span class="constructor">Faust_Bits_int</span>)&nbsp;<span class="keyword">in</span><br>
22 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">match</span>&nbsp;v&nbsp;<span class="keyword">with</span><br>
23 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keywordsign">|</span><span class="constructor">N</span>&nbsp;i&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
24 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span>&nbsp;i&nbsp;&gt;&nbsp;value_macro_to_int&nbsp;<span class="constructor">Faust_Max_int</span>&nbsp;<span class="keyword">then</span>&nbsp;<br>
25 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return_N&nbsp;(i&nbsp;-&nbsp;int_of_float&nbsp;(n&nbsp;*.&nbsp;floor&nbsp;(((float_of_int&nbsp;i)&nbsp;+.&nbsp;n/.2.)/.n)))<br>
26 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">else</span>&nbsp;<span class="keyword">if</span>&nbsp;i&nbsp;&lt;&nbsp;value_macro_to_int&nbsp;<span class="constructor">Faust_Min_int</span>&nbsp;<span class="keyword">then</span>&nbsp;<br>
27 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return_N&nbsp;(i&nbsp;+&nbsp;int_of_float&nbsp;(n&nbsp;*.&nbsp;floor&nbsp;((n/.2.&nbsp;-.&nbsp;(float_of_int&nbsp;i)&nbsp;-.&nbsp;1.)/.n)))<br>
28 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">else</span>&nbsp;return_N&nbsp;i<br>
29 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keywordsign">|</span><span class="constructor">R</span>&nbsp;f&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;<br>
30 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span>&nbsp;f&nbsp;&gt;&nbsp;float_of_int&nbsp;(value_macro_to_int&nbsp;<span class="constructor">Faust_Max_int</span>)&nbsp;<span class="keyword">then</span>&nbsp;<br>
31 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return_R&nbsp;(f&nbsp;-.&nbsp;(n&nbsp;*.&nbsp;floor&nbsp;((f&nbsp;+.&nbsp;n/.2.)/.n)))<br>
32 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">else</span>&nbsp;<span class="keyword">if</span>&nbsp;f&nbsp;&lt;&nbsp;float_of_int&nbsp;(value_macro_to_int&nbsp;<span class="constructor">Faust_Min_int</span>)&nbsp;<span class="keyword">then</span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>
33 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return_R&nbsp;(f&nbsp;+.&nbsp;(n&nbsp;*.&nbsp;floor&nbsp;((n/.2.&nbsp;-.&nbsp;f&nbsp;-.&nbsp;1.)/.n)))<br>
34 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">else</span>&nbsp;return_R&nbsp;f<br>
35 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keywordsign">|</span><span class="constructor">Vec</span>&nbsp;(size,&nbsp;vec)&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;make_vector&nbsp;size&nbsp;(<span class="keyword">fun</span>&nbsp;i&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;normalize&nbsp;(vec&nbsp;i))<br>
36 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keywordsign">|</span><span class="constructor">Zero</span>&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;<span class="constructor">Zero</span><br>
37 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keywordsign">|</span><span class="constructor">W</span>&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;<span class="constructor">W</span></code></body></html>