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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
#pike __REAL_VERSION__
//! Returns the parity of the integer @[value]. If the
//! parity is odd 1 is returned. If it is even 0 is
//! returned.
int(0..1) parity(int(0..) value) {
if(value<0) error("Parity can not determined for negative values.\n");
return Gmp.mpz(value)->popcount()&1;
}
constant NATIVE_MIN = __builtin.NATIVE_INT_MIN;
constant NATIVE_MAX = __builtin.NATIVE_INT_MAX;
//! @decl constant NATIVE_MIN;
//! @decl constant NATIVE_MAX;
//!
//! The limits for using the native representation of integers on the
//! current architecture. Any integer that is outside this range uses
//! a more complex and slower representation. Also, some builtin
//! functions that don't expect very large integers might start to
//! complain about invalid argument type when given values outside
//! this range (they typically say something like "Expected integer,
//! got object").
//!
//! @[NATIVE_MIN] is not greater than @expr{-2147483648@}
//! (@expr{-0x80000000@}).
//!
//! @[NATIVE_MAX] is not less than @expr{2147483647@}
//! (@expr{0x7fffffff@}).
//!
//! @note
//! The size of the native integers can be controlled when Pike is
//! compiled with the configure flags @expr{--with-int-int@},
//! @expr{--with-long-int@}, and @expr{--with-long-long-int@}. The
//! default is to use the longest available integer type that fits
//! inside a pointer, which typically means that it's 64 bit on "true"
//! 64 bit architectures.
//!
//! Swaps the upper and lower byte in a word.
//!
//! @seealso
//! @[swap_long()]
int(0..65535) swap_word(int(0..65535) i) {
return ((i&255)<<8) | ((i&(255<<8))>>8);
}
//! Swaps the upper and lower word in a longword, and the upper and
//! lower bytes in the words. Simply put, the bytes are reversed.
//!
//! @seealso
//! @[swap_word()]
int(0..4294967295) swap_long(int(0..4294967295) i) {
return ((i&255)<<24) | ((i&(255<<8))<<8) |
((i&(255<<16))>>8) | ((i&(255<<24))>>24);
}
//! Reverses the order of the low order @[bits] number of bits
//! of the value @[value].
//!
//! @note
//! Any higher order bits of the value will be cleared.
//! The returned value will thus be unsigned.
//!
//! @seealso
//! @[reverse()], @[swap_word()], @[swap_long()]
int(0..) reflect(int value, int(0..) bits)
{
int aligned_bits = bits;
if (bits & (bits-1)) {
// Find the closest larger even power of two.
aligned_bits <<= 1;
while (aligned_bits & (aligned_bits-1)) {
aligned_bits -= (aligned_bits & ~(aligned_bits-1));
}
}
bits = aligned_bits - bits;
// Perform pair-wise swapping of bit-sequences.
int mask = (1<<aligned_bits)-1;
int filter = mask;
while (aligned_bits >>= 1) {
filter ^= filter>>aligned_bits;
value = (value & filter)>>aligned_bits |
(value & (filter^mask))<<aligned_bits;
}
// Adjust the returned value in case we've swapped more bits
// than needed. We then have junk in the lowest order bits.
return value>>bits;
}
//! The type of @[Int.inf]. Do not create more instances of this.
class Inf {
protected constant neg = 0;
protected int __hash() { return 17; }
protected int(0..1) _equal(mixed arg) {
if(neg && arg==-Math.inf) return 1;
if(!neg && arg==Math.inf) return 1;
return arg==this;
}
protected int(0..1) _is_type(mixed type) { return (< "int", "object" >)[type]; }
protected mixed _random() { return this; }
protected mixed _sqrt() { return this; }
// % == nan
// & == nan
protected mixed `*(mixed ... args) {
int n = neg;
foreach(args, mixed arg)
if(arg<0) n = !n;
if(n) return ninf;
return inf;
}
protected mixed ``*(mixed ... args) { return `*(@args); }
protected mixed `+(mixed ... args) {
foreach(args, mixed arg)
if(arg==`-()) error("NaN\n");
return this;
}
protected mixed ``+(mixed ... args) { return ``+(@args); }
protected mixed `-(mixed ... args) {
if(!sizeof(args)) {
if(neg) return inf;
return ninf;
}
foreach(args, mixed arg)
if(arg==inf || arg==ninf) error("NaN\n");
return this;
}
protected mixed ``-(mixed arg) {
if(arg==inf || arg==ninf) error("NaN\n");
return this;
}
protected int(0..1) `<(mixed arg) {
if(arg==this) return 0;
return neg;
}
protected int(0..1) `>(mixed arg) {
if(arg==this) return 0;
return !neg;
}
protected mixed `~() { return `-(); }
protected mixed `<<(mixed arg) {
if(arg<0) error("Got negative shift count.\n");
return this;
}
protected mixed ``<<(mixed arg) {
if(arg<0) return ninf;
return inf;
}
protected mixed `>>(mixed arg) {
if(arg<0) error("Got negative shift count.\n");
return this;
}
protected mixed ``>>(mixed arg) {
return 0;
}
protected mixed cast(string to) {
switch(to) {
case "string":
return "inf";
case "float":
return Math.inf;
default:
return UNDEFINED;
}
}
protected string _sprintf(int t) {
return t=='O' && (neg?"-":"")+"Int.inf";
}
}
class NInf {
inherit Inf;
constant neg = 1;
}
protected Inf ninf = NInf();
//! An object that behaves like positive infinity.
Inf inf = Inf();
|
