summaryrefslogtreecommitdiff
path: root/opcodes/tabmorphak.xml
diff options
context:
space:
mode:
Diffstat (limited to 'opcodes/tabmorphak.xml')
-rw-r--r--opcodes/tabmorphak.xml4
1 files changed, 2 insertions, 2 deletions
diff --git a/opcodes/tabmorphak.xml b/opcodes/tabmorphak.xml
index 11b9fe4..b6d1e4b 100644
--- a/opcodes/tabmorphak.xml
+++ b/opcodes/tabmorphak.xml
@@ -29,7 +29,7 @@
<refsect1>
<title>Initialization</title>
<para>
- <emphasis>ifn1, ifn2 , ifn3, ifn4, ... ifnN</emphasis> - function table numbers. This is a set of chosen tables the user want to use in the morphing. All tables must have the same length. Be aware that only two of these tables can be chosen for the morphing at one time. Since it is possible to use non-integer numbers for the <emphasis>atabnum1</emphasis> and <emphasis>atabnum2</emphasis> arguments, the morphing is the result from the interpolation between adjacent consecutive tables of the set.
+ <emphasis>ifn1, ifn2 , ifn3, ifn4, ... ifnN</emphasis> - function table numbers. This is a set of chosen tables the user want to use in the morphing. All tables must have the same length. Be aware that only two of these tables can be chosen for the morphing at one time. Since it is possible to use non-integer numbers for the <emphasis>ktabnum1</emphasis> and <emphasis>ktabnum2</emphasis> arguments, the morphing is the result from the interpolation between adjacent consecutive tables of the set.
</para>
</refsect1>
@@ -51,7 +51,7 @@
<emphasis>ktabnum2</emphasis> - the second table chosen for the morphing. This number doesn’t express the table number directly, but the position of the table in the set sequence (starting from 0 to N-1). If this number is an integer, corresponding table will be chosen unaltered. If it contains fractional values, then an interpolation with the next adjacent table will result.
</para>
<para>
- The <emphasis>tabmorphak</emphasis> family of opcodes is similar to the <link linkend="table"><citetitle>table</citetitle></link> family, but allows morphing between two tables chosen into a set of tables. Firstly the user has to provide a set of tables of equal length (ifn2 [, ifn3, ifn4, ... ifnN]). Then he can choose a pair of tables in the set in order to perform the morphing: <emphasis>atabnum1</emphasis> and <emphasis>atabnum2</emphasis> are filled with numbers (zero represents the first table in the set, 1 the second, 2 the third and so on). Then determine the morphing between the two chosen tables with the <emphasis>aweightpoint</emphasis> parameter. After that the resulting table can be indexed with the <emphasis>aindex</emphasis> parameter like a normal table opcode. If the value of this parameter surpasses the length of tables (which must be the same for all tables), then it is wrapped around.
+ The <emphasis>tabmorphak</emphasis> family of opcodes is similar to the <link linkend="table"><citetitle>table</citetitle></link> family, but allows morphing between two tables chosen into a set of tables. Firstly the user has to provide a set of tables of equal length (ifn2 [, ifn3, ifn4, ... ifnN]). Then he can choose a pair of tables in the set in order to perform the morphing: <emphasis>ktabnum1</emphasis> and <emphasis>ktabnum2</emphasis> are filled with numbers (zero represents the first table in the set, 1 the second, 2 the third and so on). Then determine the morphing between the two chosen tables with the <emphasis>kweightpoint</emphasis> parameter. After that the resulting table can be indexed with the <emphasis>aindex</emphasis> parameter like a normal table opcode. If the value of this parameter surpasses the length of tables (which must be the same for all tables), then it is wrapped around.
</para>
<para>
<emphasis>tabmorphak</emphasis> works at a-rate, but kweightpoint, ktabnum1 and ktabnum2 are working at k-rate, making it more efficient than <link linkend="tabmorpha"><citetitle>tabmorpha</citetitle></link>, since there are less calculations. Except the rate of these three arguments, it is identical to <link linkend="tabmorpha"><citetitle>tabmorpha</citetitle></link>.