/usr/share/calligrasheets/functions/bitops.xml is in calligrasheets 1:3.0.1-0ubuntu4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 | <!DOCTYPE KSpreadFunctions>
<KSpreadFunctions>
<Group>
<GroupName>Bit Operations</GroupName>
<Function>
<Name>BITAND</Name>
<Type>Int</Type>
<Parameter>
<Comment>First number</Comment>
<Type>Int</Type>
</Parameter>
<Parameter>
<Comment>Second number</Comment>
<Type>Int</Type>
</Parameter>
<Help>
<Text>The BITAND() function performs a bit-wise AND operation for the two integer parameters.</Text>
<Syntax>BITAND(value; value)</Syntax>
<Example>BITAND(12;10) returns 8 (because decimal 12 is binary 1100, and decimal 10 is binary 1010; and 1100 "anded" with 1010 is 1000, which is integer 8).</Example>
<Related>BITOR</Related>
<Related>BITXOR</Related>
</Help>
</Function>
<Function>
<Name>BITLSHIFT</Name>
<Type>Int</Type>
<Parameter>
<Comment>First number</Comment>
<Type>Int</Type>
</Parameter>
<Parameter>
<Comment>Amount to left shift by</Comment>
<Type>Int</Type>
</Parameter>
<Help>
<Text>The BITLSHIFT() function performs a bit-wise left shift operation of the first parameter. The number of bits to shift by is specified by the second parameter. Note that a negative number of bits to left shift by becomes a right shift. </Text>
<Syntax>BITLSHIFT(value; shift size)</Syntax>
<Related>BITLSHIFT</Related>
</Help>
</Function>
<Function>
<Name>BITRSHIFT</Name>
<Type>Int</Type>
<Parameter>
<Comment>First number</Comment>
<Type>Int</Type>
</Parameter>
<Parameter>
<Comment>Amount to right shift by</Comment>
<Type>Int</Type>
</Parameter>
<Help>
<Text>The BITRSHIFT() function performs a bit-wise right shift operation of the first parameter. The number of bits to shift by is specified by the second parameter. Note that a negative number of bits to right shift by becomes a left shift. </Text>
<Syntax>BITRSHIFT(value; shift size)</Syntax>
<Related>BITLSHIFT</Related>
</Help>
</Function>
<Function>
<Name>BITOR</Name>
<Type>Int</Type>
<Parameter>
<Comment>First number</Comment>
<Type>Int</Type>
</Parameter>
<Parameter>
<Comment>Second number</Comment>
<Type>Int</Type>
</Parameter>
<Help>
<Text>The BITOR() function performs a bit-wise OR operation for the two integer parameters. </Text>
<Syntax>BITOR(value; value)</Syntax>
<Example>BITOR(12;10) returns 14 (because decimal 12 is binary 1100, and decimal 10 is binary 1010; and 1100 "ored" with 1010 is 1110, which is integer 14).</Example>
<Related>BITAND</Related>
<Related>BITXOR</Related>
</Help>
</Function>
<Function>
<Name>BITXOR</Name>
<Type>Int</Type>
<Parameter>
<Comment>First number</Comment>
<Type>Int</Type>
</Parameter>
<Parameter>
<Comment>Second number</Comment>
<Type>Int</Type>
</Parameter>
<Help>
<Text>The BITXOR() function performs a bit-wise exclusive-OR operation for the two integer parameters. </Text>
<Syntax>BITXOR(value; value)</Syntax>
<Example>BITXOR(12;10) returns 6 (because decimal 12 is binary 1100, and decimal 10 is binary 1010; and 1100 "xored" with 1010 is 0110, which is integer 6).</Example>
<Related>BITAND</Related>
<Related>BITOR</Related>
</Help>
</Function>
</Group>
</KSpreadFunctions>
|