diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 18:24:48 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 18:24:48 +0000 |
commit | cca66b9ec4e494c1d919bff0f71a820d8afab1fa (patch) | |
tree | 146f39ded1c938019e1ed42d30923c2ac9e86789 /src/3rdparty/adaptagrams/libcola/pseudorandom.cpp | |
parent | Initial commit. (diff) | |
download | inkscape-cca66b9ec4e494c1d919bff0f71a820d8afab1fa.tar.xz inkscape-cca66b9ec4e494c1d919bff0f71a820d8afab1fa.zip |
Adding upstream version 1.2.2.upstream/1.2.2upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/3rdparty/adaptagrams/libcola/pseudorandom.cpp')
-rw-r--r-- | src/3rdparty/adaptagrams/libcola/pseudorandom.cpp | 48 |
1 files changed, 48 insertions, 0 deletions
diff --git a/src/3rdparty/adaptagrams/libcola/pseudorandom.cpp b/src/3rdparty/adaptagrams/libcola/pseudorandom.cpp new file mode 100644 index 0000000..6577b3a --- /dev/null +++ b/src/3rdparty/adaptagrams/libcola/pseudorandom.cpp @@ -0,0 +1,48 @@ +/* + * vim: ts=4 sw=4 et tw=0 wm=0 + * + * libcola - A library providing force-directed network layout using the + * stress-majorization method subject to separation constraints. + * + * Copyright (C) 2015 Monash University + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * See the file LICENSE.LGPL distributed with the library. + * + * This library 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. + * + * Author(s): Tim Dwyer +*/ + +#include "libcola/pseudorandom.h" + +namespace cola { + +PseudoRandom::PseudoRandom(double s) + : a(214013), + c(2531011), + m(2147483648), + range(32767), + seed(s) +{ +} + +double PseudoRandom::getNext(void) +{ + seed = (seed * a + c) % m; + return (seed >> 16) / range; +} + +double PseudoRandom::getNextBetween(double min, double max) +{ + return min + getNext() * (max - min); +} + + +} + |