Vroni 7.8 :

- aggiornamento versione.
This commit is contained in:
SaraP
2025-01-29 16:24:30 +01:00
parent 25ebbb577c
commit 739088af9f
52 changed files with 181 additions and 126 deletions
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) Martin Held 1999-2023 */
/* Copyright (C) Martin Held 1999-2025 */
/* */
/* */
/* C O P Y R I G H T */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+87 -42
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
@@ -41,6 +41,20 @@
#include "vddata.h"
vr_bool vroniObject::CouldBeFine(double eps, coord c1, double rr1, coord c3, double rr3)
{
double dist;
dist = PntPntDist(c1, c3);
if (dist > rr3) dist -= rr3;
else dist = rr3 - dist;
dist -= rr1;
return (eq(dist, eps));
}
/* */
/* Calculate the Voronoi center of three arcs */
@@ -54,7 +68,9 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
double rr1, rr2, rr3, rad;
coord centers[VRONI_MAXSOL];
double radii[VRONI_MAXSOL];
int num_sol=0;
coord special_centers[2];
double special_radii[2];
int num_sol = 0, special_sol = 0;
coord tmp;
int tmpi;
double tmpr;
@@ -68,27 +84,7 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
coord ep, v;
#ifdef TRACE
if ((i == 0) && (j == 1) && (k == 23)) {
printf("arc %d-arc %d-arc %d\n", i, j, k);
printf("start1 : (%20.16f %20.16f)\n", GetArcStartCoord(i).x,
GetArcStartCoord(i).y);
printf("end1 : (%20.16f %20.16f)\n", GetArcEndCoord(i).x,
GetArcEndCoord(i).y);
printf("center1: (%20.16f %20.16f)\n", GetArcCenter(i).x,
GetArcCenter(i).y);
printf("start2 : (%20.16f %20.16f)\n", GetArcStartCoord(j).x,
GetArcStartCoord(j).y);
printf("end2 : (%20.16f %20.16f)\n", GetArcEndCoord(j).x,
GetArcEndCoord(j).y);
printf("center2: (%20.16f %20.16f)\n", GetArcCenter(j).x,
GetArcCenter(j).y);
printf("start3 : (%20.16f %20.16f)\n", GetArcStartCoord(k).x,
GetArcStartCoord(k).y);
printf("end3 : (%20.16f %20.16f)\n", GetArcEndCoord(k).x,
GetArcEndCoord(k).y);
printf("center3: (%20.16f %20.16f)\n", GetArcCenter(k).x,
GetArcCenter(k).y);
}
printf("ArcArcArcCntr: %d - %d - %d; bisector edge %d\n", i, j, k, e);
#endif
i_in = i;
@@ -103,6 +99,30 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
/* */
SortThreeNumbers(i,j,k,t);
#ifdef TRACE
if ((i == 0) && (j == 1) && (k == 3)) {
printf("arc %d-arc %d-arc %d\n", i, j, k);
printf("start%d : (%20.16f %20.16f)\n", i, GetArcStartCoord(i).x,
GetArcStartCoord(i).y);
printf("end%d : (%20.16f %20.16f)\n", i, GetArcEndCoord(i).x,
GetArcEndCoord(i).y);
printf("center%d: (%20.16f %20.16f)\n", i, GetArcCenter(i).x,
GetArcCenter(i).y);
printf("start%d : (%20.16f %20.16f)\n", j, GetArcStartCoord(j).x,
GetArcStartCoord(j).y);
printf("end%d : (%20.16f %20.16f)\n", j, GetArcEndCoord(j).x,
GetArcEndCoord(j).y);
printf("center%d: (%20.16f %20.16f)\n", j, GetArcCenter(j).x,
GetArcCenter(j).y);
printf("start%d : (%20.16f %20.16f)\n", k, GetArcStartCoord(k).x,
GetArcStartCoord(k).y);
printf("end%d : (%20.16f %20.16f)\n", k, GetArcEndCoord(k).x,
GetArcEndCoord(k).y);
printf("center%d: (%20.16f %20.16f)\n", k, GetArcCenter(k).x,
GetArcCenter(k).y);
}
#endif
/* */
/* Check whether the three cites are all in lists */
/* */
@@ -196,6 +216,7 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
ik_joint = false;
is_special = false;
num_sol = 0;
special_sol = 0;
/* */
/* check whether any pair of the arcs has (roughly) a common endpoint */
@@ -519,12 +540,16 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
eq(VecDet(c1,c2,epi), eps) ||
eq(VecDet(c1,c2,spj), eps) ||
eq(VecDet(c1,c2,epj), eps)) {
is_special = true;
centers[0] = c1;
centers[1] = c2;
radii[0] = rr1;
radii[1] = rr2;
num_sol = 2;
if (CouldBeFine(eps, c1, rr1, c3, rr3)) {
special_centers[special_sol] = c1;
special_radii[special_sol] = rr1;
++special_sol;
}
if (CouldBeFine(eps, c2, rr2, c3, rr3)) {
special_centers[special_sol] = c2;
special_radii[special_sol] = rr2;
++special_sol;
}
}
}
if ((!jk_joint) && (Abs(rr2+rr3 - d_c2c3) <= eps)) {
@@ -532,12 +557,16 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
eq(VecDet(c2,c3,epj), eps) ||
eq(VecDet(c2,c3,spk), eps) ||
eq(VecDet(c2,c3,epk), eps)) {
is_special = true;
centers[0] = c2;
centers[1] = c3;
radii[0] = rr2;
radii[1] = rr3;
num_sol = 2;
if (CouldBeFine(eps, c2, rr2, c1, rr1)) {
special_centers[special_sol] = c2;
special_radii[special_sol] = rr2;
++special_sol;
}
if (CouldBeFine(eps, c3, rr3, c1, rr1)) {
special_radii[special_sol] = rr3;
special_centers[special_sol] = c3;
++special_sol;
}
}
}
if ((!ik_joint) && (Abs(rr1+rr3 - d_c1c3) <= eps)) {
@@ -545,17 +574,19 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
eq(VecDet(c1,c3,epi), eps) ||
eq(VecDet(c1,c3,spk), eps) ||
eq(VecDet(c1,c3,epk), eps)) {
is_special = true;
centers[0] = c1;
centers[1] = c3;
radii[0] = rr1;
radii[1] = rr3;
num_sol = 2;
if (CouldBeFine(eps, c1, rr1, c2, rr2)) {
special_centers[special_sol] = c1;
special_radii[special_sol] = rr1;
++special_sol;
}
if (CouldBeFine(eps, c3, rr3, c2, rr2)) {
special_radii[special_sol] = rr3;
special_centers[special_sol] = c3;
++special_sol;
}
}
}
if (!is_special) {
/* */
/* general case */
/* */
@@ -592,6 +623,20 @@ vr_bool vroniObject::ArcArcArcCntr(int i, int j, int k, int e,
num_sol = CircCircCircCenters(c1, c2, c3, rr1, rr2, rr3, centers,
radii, eps);
if (special_sol == 2) {
centers[num_sol] = special_centers[1];
radii[num_sol] = special_radii[1];
--special_sol;
++num_sol;
}
if (special_sol == 1) {
centers[num_sol] = special_centers[0];
radii[num_sol] = special_radii[0];
--special_sol;
++num_sol;
}
#ifdef TRACE
printf("in the general case! num_sol = %d\n", num_sol);
printf("i_in = %d, j_in = %d, k_in = %d\n", i_in, j_in, k_in);
+27 -8
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
@@ -54,12 +54,14 @@ vr_bool vroniObject::ArcArcPntCntr(int i, int j, int k, int e,
coord centers[VRONI_MAXSOL];
double radii[VRONI_MAXSOL];
int num_sol = 0, best_sol = NIL, old_num_sol = 0;
int num_sol = 0, best_sol = NIL, old_num_sol = 0, special_sol = 0;
double eps = ZERO;
coord spi, spj, epj, epi, ep, v;
int i_in, j_in;
vr_bool no_check, is_arc_endpoint, is_special;
vr_bool spi_in_common, epi_in_common, counter_tangential;
coord special_centers[2];
double special_radii[2];
i_in = i;
j_in = j;
@@ -154,6 +156,7 @@ vr_bool vroniObject::ArcArcPntCntr(int i, int j, int k, int e,
no_check = false;
is_special = false;
num_sol = old_num_sol;
special_sol = 0;
#ifdef TRACE
if ((e == 15) && (i_in == 5)) {
@@ -269,12 +272,16 @@ vr_bool vroniObject::ArcArcPntCntr(int i, int j, int k, int e,
/* */
if (eq(VecDet(c1,c2,spi), eps) || eq(VecDet(c1,c2,epi), eps) ||
eq(VecDet(c1,c2,spj), eps) || eq(VecDet(c1,c2,epj), eps)) {
is_special = true;
centers[0] = c1;
centers[1] = c2;
radii[0] = rr1;
radii[1] = rr2;
num_sol = 2;
if (CouldBeFine(eps, c1, rr1, c3, rr3)) {
special_centers[special_sol] = c1;
special_radii[special_sol] = rr1;
++special_sol;
}
if (CouldBeFine(eps, c2, rr2, c3, rr3)) {
special_centers[special_sol] = c2;
special_radii[special_sol] = rr2;
++special_sol;
}
}
}
@@ -285,6 +292,18 @@ vr_bool vroniObject::ArcArcPntCntr(int i, int j, int k, int e,
//printf("ordinary\n");
num_sol = CircCircCircCenters(c1, c2, c3, rr1, rr2, rr3, centers,
radii, eps);
if (special_sol == 2) {
centers[num_sol] = special_centers[1];
radii[num_sol] = special_radii[1];
--special_sol;
++num_sol;
}
if (special_sol == 1) {
centers[num_sol] = special_centers[0];
radii[num_sol] = special_radii[0];
--special_sol;
++num_sol;
}
}
}
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2007-2023 S. Huber, M. Held */
/* Copyright (C) 2007-2025 S. Huber, M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) Martin Held 1999-2023 */
/* Copyright (C) Martin Held 1999-2025 */
/* */
/* This code is provided at no charge to you for non-commercial purposes */
/* only and only for use internal to your institution. You may use this */
+2 -2
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
@@ -1287,7 +1287,7 @@ int vroniObject::GetNextSite(void)
int i, j;
assert(m_cur_rnd_sites > 0);
assert(m_cur_rnd_sites <= m_num_rnd_sites);
i = RandomInteger(m_cur_rnd_sites);
RandomInteger(m_cur_rnd_sites, i);
assert((i >= 0) && (i < m_cur_rnd_sites));
j = m_rnd_sites[i];
--m_cur_rnd_sites;
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) Martin Held 1999-2023 */
/* Copyright (C) Martin Held 1999-2025 */
/* */
/* */
/* C O P Y R I G H T */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1993-2023 M. Held */
/* Copyright (C) 1993-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -14
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2010-2023 M. Held, S. Huber */
/* Copyright (C) 2010-2025 M. Held, S. Huber */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
@@ -31,7 +31,6 @@
/* */
#include "fpkernel.h"
#include "vroni_object.h"
#include "random.h"
/* */
@@ -45,17 +44,5 @@ coord vroniObject::CirclePnt(const coord & c, double_arg r, double_arg phi)
return q;
}
/* */
/* Compute a point distributed uniformly random */
/* */
coord vroniObject::UniformRandomPoint()
{
coord q;
UniformRandom(q.x);
UniformRandom(q.y);
return q;
}
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2003-2023 M. Held */
/* Copyright (C) 2003-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2003--2023 M. Held */
/* Copyright (C) 2003--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README" or in the */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2003--2023 M. Held */
/* Copyright (C) 2003--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002-2023 M. Held */
/* Copyright (C) 2002-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002-2023 M. Held */
/* Copyright (C) 2002-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.pdf" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002-2023 M. Held */
/* Copyright (C) 2002-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.pdf" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1996-2023 M. Held */
/* Copyright (C) 1996-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.pdf" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1996-2023 M. Held */
/* Copyright (C) 1996-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2001-2023 M. Held */
/* Copyright (C) 2001-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2000-2023 M. Held */
/* Copyright (C) 2000-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2002--2023 M. Held */
/* Copyright (C) 2002--2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2003-2023 M. Held */
/* Copyright (C) 2003-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2001-2023 M. Held */
/* Copyright (C) 2001-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 1999-2023 M. Held */
/* Copyright (C) 1999-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2001-2023 M. Held */
/* Copyright (C) 2001-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2001-2023 M. Held */
/* Copyright (C) 2001-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README" or in the */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2001-2023 M. Held */
/* Copyright (C) 2001-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2010-2023 M. Held, S. Huber */
/* Copyright (C) 2010-2025 M. Held, S. Huber */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */
+6 -2
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) Martin Held 1999-2023 */
/* Copyright (C) Martin Held 1999-2025 */
/* */
/* */
/* C O P Y R I G H T */
@@ -974,7 +974,11 @@ void vroniObject::apiTerminateProgram()
}
#endif
#ifdef VRONI_INFO
#ifdef RANDOM_R
free(rdata);
#endif
#ifdef VRONI_INFO
/* */
/* check and report memory used */
/* */
+1 -1
View File
@@ -1,6 +1,6 @@
/*****************************************************************************/
/* */
/* Copyright (C) 2001-2023 M. Held */
/* Copyright (C) 2001-2025 M. Held */
/* */
/* This code is not in the public domain. All rights reserved! Please make */
/* sure to read the full copyright statement contained in "README.txt" or in */