C = BITAND(A,B) returns the bit-wise AND of the two arguments

C = BITCMP(A,N) returns the bit-wise complement of A as an N-bit non-negative integer

C = BITOR(A,B) returns the bit-wise OR of the two arguments A and B

C = BITXOR(A,B) returns the bit-wise exclusive OR of the two arguments A and B

C = BITSET(A,BIT,V) sets the bit at position BIT to the value V

C = BITGET(A,BIT) returns the value of the bit at position BIT in A

C = BITSHIFT(A,K,N) returns the value of A shifted by K bits. Shifting by K is the same as multiplication by

                    2^K and then rounding to the nearest integer (i.e. C = fix(A*2^K)).  If the shift causes

                    C to overflow N bits, the overflowing bits are dropped

C = XOR(S,T) is the logical symmetric difference of elements S and T. The result is one where either S or T,

             but not both, is nonzero. The result is zero where S and T are both zero or nonzero.

Quote:

---

Lothian, J. and Morry, M. (1977). The problem of aggregation: direct or indirect seasonal adjustment. Research paper 77-08-001E, Seasonal Adjustment and Time Series Staff, Statistics Canada.

Lothian, J. and Morry, M. (1978). A test for the presence of identifiable seasonality when using the X-11 program. Research paper 78-10-002E, Seasonal Adjustment and Time Series Staff, Statistics Canada.

---