Mercurial > octave
view scripts/strings/dec2hex.m @ 28886:d8318c12d903
test: remove unnecessary BIST tests in m-files checking for excessive number of inputs.
Remove BIST tests now that interpreter enforces calling function with no more than
the number of arguments defined in the function prototype.
* makeUniqueStrings.m, makeValidName.m, base64decode.m, base64encode.m,
record.m, sound.m, soundsc.m, acosd.m, acot.m, acotd.m, acoth.m, acsc.m,
acscd.m, acsch.m, asec.m, asecd.m, asech.m, asind.m, atan2d.m, atand.m, cosd.m,
cot.m, cotd.m, coth.m, csc.m, cscd.m, csch.m, sec.m, secd.m, sech.m, sind.m,
tand.m, accumdim.m, bincoeff.m, bitget.m, bitset.m, cell2mat.m, circshift.m,
cplxpair.m, cumtrapz.m, deg2rad.m, flip.m, fliplr.m, flipud.m, int2str.m,
interpft.m, logspace.m, num2str.m, postpad.m, prepad.m, rad2deg.m, rot90.m,
rotdim.m, shift.m, subsindex.m, trapz.m, rotx.m, roty.m, rotz.m, getappdata.m,
getpixelposition.m, guidata.m, isappdata.m, waitforbuttonpress.m,
__gripe_missing_component__.m, bessel.m, hsv2rgb.m, ind2gray.m, rgb2gray.m,
rgb2hsv.m, rgbplot.m, fileread.m, javachk.m, usejava.m, findstr.m,
genvarname.m, isdir.m, vectorize.m, cond.m, cross.m, duplication_matrix.m,
expm.m, isbanded.m, isdefinite.m, isdiag.m, ishermitian.m, issymmetric.m,
istril.m, istriu.m, trace.m, vech.m, vecnorm.m, cast.m, citation.m,
compare_versions.m, grabcode.m, inputname.m, isfile.m, isfolder.m, ismac.m,
ispc.m, isunix.m, list_primes.m, methods.m, news.m, open.m, run.m, swapbytes.m,
tar.m, verLessThan.m, zip.m, odeget.m, optimget.m, stemleaf.m, allchild.m,
ancestor.m, close.m, groot.m, hgsave.m, isaxes.m, isfigure.m, isgraphics.m,
ishandle.m, isprop.m, linkaxes.m, rotate.m, saveas.m, conv.m, poly.m,
polyint.m, polyreduce.m, ppval.m, roots.m, addpref.m, getpref.m, ispref.m,
rmpref.m, setpref.m, profile.m, profshow.m, powerset.m, autoreg_matrix.m,
bartlett.m, blackman.m, detrend.m, fftconv.m, fftfilt.m, fftshift.m, hamming.m,
hanning.m, ifftshift.m, sinewave.m, spectral_adf.m, spectral_xdf.m, unwrap.m,
nonzeros.m, spconvert.m, sprand.m, sprandn.m, beta.m, betainc.m, betaln.m,
cosint.m, expint.m, factorial.m, legendre.m, nchoosek.m, nthroot.m, perms.m,
pow2.m, primes.m, reallog.m, realpow.m, realsqrt.m, sinint.m, hankel.m, hilb.m,
invhilb.m, magic.m, pascal.m, toeplitz.m, vander.m, wilkinson.m, center.m,
corr.m, cov.m, discrete_cdf.m, discrete_inv.m, discrete_pdf.m, empirical_cdf.m,
empirical_inv.m, empirical_pdf.m, iqr.m, kendall.m, kurtosis.m, mad.m,
meansq.m, median.m, moment.m, prctile.m, quantile.m, range.m, run_count.m,
skewness.m, spearman.m, statistics.m, std.m, var.m, base2dec.m, bin2dec.m,
blanks.m, dec2base.m, dec2bin.m, dec2hex.m, endsWith.m, erase.m, hex2dec.m,
index.m, isletter.m, isstring.m, isstrprop.m, mat2str.m, ostrsplit.m, rindex.m,
startsWith.m, strtrunc.m, substr.m, fail.m, addtodate.m, asctime.m, ctime.m,
date.m, datestr.m, eomday.m, etime.m, is_leap_year.m, now.m:
remove unnecessary BIST tests in m-files checking for excessive number of inputs.
author | Rik <rik@octave.org> |
---|---|
date | Fri, 09 Oct 2020 13:28:53 -0700 |
parents | 28de41192f3c |
children | 1a3cb2e1644a |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 1996-2020 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 {} {} dec2hex (@var{d}) ## @deftypefnx {} {} dec2hex (@var{d}, @var{len}) ## Return a string representing the conversion of the integer @var{d} to a ## hexadecimal (base16) number. ## ## If @var{d} is negative, return the two's complement binary value of @var{d}. ## If @var{d} is a matrix or cell array, return a string matrix with one row ## for each element in @var{d}, padded with leading zeros to the width of the ## largest value. ## ## The optional second argument, @var{len}, specifies the minimum number of ## digits in the result. ## ## Examples: ## ## @example ## @group ## dec2hex (2748) ## @result{} "ABC" ## ## dec2hex (-2) ## @result{} "FE" ## @end group ## @end example ## ## @seealso{hex2dec, dec2base, dec2bin} ## @end deftypefn function h = dec2hex (d, len) if (nargin == 0) print_usage (); endif if (iscell (d)) d = cell2mat (d); endif ## Create column vector for algorithm (output is always col. vector anyways) d = d(:); lt_zero_idx = (d < 0); if (any (lt_zero_idx)) ## FIXME: Need an algorithm that works with larger values such as int64. if (any (d(lt_zero_idx) < -2^52)) error ("dec2hex: negative inputs cannot be less than -flintmax () / 2"); elseif (any (d(lt_zero_idx) < intmin ("int32"))) d(lt_zero_idx) += flintmax (); elseif (any (d < intmin ("int16"))) d(lt_zero_idx) += double (intmax ("uint32")) + 1; elseif (any (d < intmin ("int8"))) d(lt_zero_idx) += double (intmax ("uint16"))+ 1; else d(lt_zero_idx) += double (intmax ("uint8")) + 1; endif endif if (nargin == 1) h = dec2base (d, 16); else h = dec2base (d, 16, len); endif endfunction %!assert (dec2hex (2748), "ABC") %!assert (dec2hex (2748, 5), "00ABC") %!assert (dec2hex ([2748, 2746]), ["ABC"; "ABA"]) %!assert (dec2hex ({2748, 2746}), ["ABC"; "ABA"]) %!assert (dec2hex ({2748, 2746}, 4), ["0ABC"; "0ABA"]) ## Test negative inputs %!assert (dec2hex (-3), "FD") %!assert (dec2hex (-3, 1), "FD") %!assert (dec2hex (-3, 3), "0FD") %!assert (dec2hex (-2^7 -1), "FF7F") %!assert (dec2hex (-2^15 -1), "FFFF7FFF") ## FIXME: Matlab returns longer string that begins with 'F' %!assert (dec2hex (-2^31 -1), "1FFFFF7FFFFFFF") ## FIXME: Matlab returns longer string that begins with 'FFF' %!assert (dec2hex (-2^52), "10000000000000") ## FIXME: Uncomment when support for int64 is added %!#assert (dec2hex (-2^63), %! "1000000000000000000000000000000000000000000000000000000000000000") %!#test %! assert (dec2hex (int64 (-2^63)), %! "1000000000000000000000000000000000000000000000000000000000000000"); %!#test %! assert (dec2hex (int64 (-2^63) -1), %! "1000000000000000000000000000000000000000000000000000000000000000"); %!#test %! assert (dec2hex (int64 (-2^63) +1), %! "1000000000000000000000000000000000000000000000000000000000000001"); %!assert (dec2hex ([-1, -2; -3, -4]), ["FF"; "FD"; "FE"; "FC"]) %!assert (dec2hex ([1, 2; 3, -4]), ["01"; "03"; "02"; "FC"]) %!assert (dec2hex ({1, 2; 3, -4}), ["01"; "03"; "02"; "FC"]) ## Test input validation %!error <Invalid call> dec2hex () %!error <negative inputs cannot be less than> dec2hex (- flintmax ())