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
|
########################################################################
##
## Copyright (C) 2004-2024 The Octave Project Developers
##
## See the file COPYRIGHT.md in the top-level directory of this
## distribution or <https://octave.org/copyright/>.
##
## This file is part of Octave.
##
## Octave is free software: you can redistribute it and/or modify it
## under the terms of the GNU General Public License as published by
## the Free Software Foundation, either version 3 of the License, or
## (at your option) any later version.
##
## Octave is distributed in the hope that it will be useful, but
## WITHOUT ANY WARRANTY; without even the implied warranty of
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
## GNU General Public License for more details.
##
## You should have received a copy of the GNU General Public License
## along with Octave; see the file COPYING. If not, see
## <https://www.gnu.org/licenses/>.
##
########################################################################
## -*- texinfo -*-
## @deftypefn {} {@var{b} =} bitget (@var{A}, @var{n})
## Return the bit value at position(s) @var{n} of the unsigned integers in
## @var{A}.
##
## The least significant bit is @var{n} = 1.
##
## @example
## @group
## bitget (100, 8:-1:1)
## @result{} 0 1 1 0 0 1 0 0
## @end group
## @end example
## @seealso{bitand, bitor, bitxor, bitset, bitcmp, bitshift, intmax, flintmax}
## @end deftypefn
## Liberally based of the version by Kai Habel from Octave Forge
function b = bitget (A, n)
if (nargin != 2)
print_usage ();
endif
if (isa (A, "double"))
Amax = ceil (log2 (flintmax));
_conv = @double;
elseif (isa (A, "single"))
Amax = ceil (log2 (flintmax ("single")));
_conv = @single;
else
if (isa (A, "uint8"))
Amax = 8;
_conv = @uint8;
elseif (isa (A, "uint16"))
Amax = 16;
_conv = @uint16;
elseif (isa (A, "uint32"))
Amax = 32;
_conv = @uint32;
elseif (isa (A, "uint64"))
Amax = 64;
_conv = @uint64;
elseif (isa (A, "int8"))
Amax = 8;
_conv = @int8;
elseif (isa (A, "int16"))
Amax = 16;
_conv = @int16;
elseif (isa (A, "int32"))
Amax = 32;
_conv = @int32;
elseif (isa (A, "int64"))
Amax = 64;
_conv = @int64;
else
error ("bitget: invalid class %s", class (A));
endif
endif
m = double (n(:));
if (any (m < 1) || any (m > Amax))
error ("bitget: N must be in the range [1,%d]", Amax);
endif
b = bitand (A, bitshift (_conv (1), uint8 (n) - uint8 (1))) != _conv (0);
endfunction
%!test
%! assert (bitget ([4, 14], [3, 3]), logical ([1, 1]));
%! assert (bitget (single ([4, 14]), [3, 3]), logical ([1, 1]));
%! pfx = {"", "u"};
%! for i = 1:2
%! for prec = [8, 16, 32, 64]
%! fcn = str2func (sprintf ("%sint%d", pfx{i}, prec));
%! assert (bitget (fcn ([4, 14]), [3, 3]), logical ([1, 1]));
%! endfor
%! endfor
## Test input validation
%!error <Invalid call> bitget ()
%!error <Invalid call> bitget (1)
%!error <invalid class> bitget ("char", 1)
%!error <N must be in the range \[1,53\]> bitget (0, 0)
%!error <N must be in the range \[1,53\]> bitget (0, 55)
%!error <N must be in the range \[1,24\]> bitget (single (0), 0)
%!error <N must be in the range \[1,24\]> bitget (single (0), 26)
%!error <N must be in the range \[1,8\]> bitget (int8 (0), 9)
%!error <N must be in the range \[1,8\]> bitget (uint8 (0), 9)
%!error <N must be in the range \[1,16\]> bitget (int16 (0), 17)
%!error <N must be in the range \[1,16\]> bitget (uint16 (0), 17)
%!error <N must be in the range \[1,32\]> bitget (int32 (0), 33)
%!error <N must be in the range \[1,32\]> bitget (uint32 (0), 33)
%!error <N must be in the range \[1,64\]> bitget (int64 (0), 65)
%!error <N must be in the range \[1,64\]> bitget (uint64 (0), 65)
|
