head 1.7; access; symbols OPENPKG_E1_MP_HEAD:1.7 OPENPKG_E1_MP:1.7 OPENPKG_E1_MP_2_STABLE:1.3.4.1 OPENPKG_E1_FP:1.3.4.1 OPENPKG_2_STABLE_MP:1.7 OPENPKG_2_STABLE_20061018:1.3.4.1 OPENPKG_2_STABLE_20060622:1.3 OPENPKG_2_STABLE:1.3.0.4 OPENPKG_2_STABLE_BP:1.3 OPENPKG_2_5_RELEASE:1.3 OPENPKG_2_5_SOLID:1.3.0.2 OPENPKG_2_5_SOLID_BP:1.3 OPENPKG_2_4_RELEASE:1.2 OPENPKG_2_4_SOLID:1.2.0.6 OPENPKG_2_4_SOLID_BP:1.2 OPENPKG_2_3_RELEASE:1.2 OPENPKG_2_3_SOLID:1.2.0.4 OPENPKG_2_3_SOLID_BP:1.2 OPENPKG_2_2_RELEASE:1.2 OPENPKG_2_2_SOLID:1.2.0.2 OPENPKG_2_2_SOLID_BP:1.2; locks; strict; comment @# @; 1.7 date 2006.11.04.19.38.35; author rse; state Exp; branches; next 1.6; commitid 9bh3TALBUluRZnTr; 1.6 date 2006.10.09.07.46.05; author rse; state Exp; branches; next 1.5; commitid g5gm7df5gaDeTYPr; 1.5 date 2006.09.21.05.59.50; author rse; state Exp; branches; next 1.4; commitid FJI3X2VhraLFSENr; 1.4 date 2006.07.07.05.57.07; author thl; state dead; branches; next 1.3; commitid QxW64jHcY1hcjTDr; 1.3 date 2005.09.26.13.23.59; author rse; state Exp; branches 1.3.4.1; next 1.2; 1.2 date 2004.08.20.17.56.44; author ms; state dead; branches; next 1.1; 1.1 date 2004.08.16.18.40.28; author rse; state Exp; branches; next ; 1.3.4.1 date 2006.10.16.14.49.06; author rse; state Exp; branches; next 1.3.4.2; commitid iZxwRSmmWscPXUQr; 1.3.4.2 date 2006.12.22.19.13.18; author thl; state Exp; branches; next ; commitid 2LefOfqsS8nsjyZr; desc @@ 1.7 log @upgrading package: crm114 20060920 -> 20061103 @ text @Index: crm_osb_hyperspace.c --- crm_osb_hyperspace.c.orig 2006-11-03 16:19:12 +0100 +++ crm_osb_hyperspace.c 2006-11-04 20:32:00 +0100 @@@@ -1290,7 +1290,7 @@@@ // Proper pythagorean (Euclidean) distance - best in // SpamConf 2006 paper - dist = sqrtf (unotk + knotu) ; + dist = (double)sqrt ((double)(unotk + knotu)) ; // treat kandu better... count matches like mismatches // 5/500 pass 1 (0 thk) @ 1.6 log @some platforms (like Solaris 9) do not have sqrtf(3), so use sqrt(3) instead @ text @a0 12 Index: crm_bit_entropy.c --- crm_bit_entropy.c.orig 2006-09-20 22:46:46 +0200 +++ crm_bit_entropy.c 2006-10-09 09:42:47 +0200 @@@@ -669,7 +669,7 @@@@ // But here, we know the event has come to pass and so the // prior is 1.0 (the vent itself is a certainty at this point; // we are now counting bits needed to encode it). - value = ( - logl ( + value = ( - log ( (count + BIT_ENTROPIC_PROBABILITY_NERF) / (total + BIT_ENTROPIC_PROBABILITY_NERF)) / 0.69314718 ); d2 3 a4 3 --- crm_osb_hyperspace.c.orig 2006-09-20 22:46:46 +0200 +++ crm_osb_hyperspace.c 2006-10-09 09:44:12 +0200 @@@@ -1286,7 +1286,7 @@@@ @ 1.5 log @upgrading package: crm114 20060704a -> 20060920 @ text @d3 1 a3 1 +++ crm_bit_entropy.c 2006-09-21 07:58:41 +0200 d13 12 @ 1.4 log @upgrading package: crm114 20060118 -> 20060704 @ text @d1 12 a12 12 Index: crm_osb_hyperspace.c --- crm_osb_hyperspace.c.orig 2005-09-10 22:30:25.000000000 +0200 +++ crm_osb_hyperspace.c 2005-09-26 15:22:05.149082482 +0200 @@@@ -1258,7 +1258,7 @@@@ // dist = (unotk * knotu + 1.0) / ( kandu * kandu + 1.0); // actual (pythag) distance,-- note the sqrt - dist = sqrtf ((unotk * knotu) / ( kandu * kandu + 1.0)); + dist = (float)sqrt((double)((unotk * knotu) / ( kandu * kandu + 1.0))); // treat kandu better... count matches like mismatches // 5/500 pass 1 (0 thk) @ 1.3 log @replace sqrtf(3) with sqrt(3) to get it building on Solaris 9 @ text @@ 1.3.4.1 log @Mass merge from CURRENT to 2-STABLE (all packages except those of JUNK class) @ text @a0 12 Index: crm_bit_entropy.c --- crm_bit_entropy.c.orig 2006-09-20 22:46:46 +0200 +++ crm_bit_entropy.c 2006-10-09 09:42:47 +0200 @@@@ -669,7 +669,7 @@@@ // But here, we know the event has come to pass and so the // prior is 1.0 (the vent itself is a certainty at this point; // we are now counting bits needed to encode it). - value = ( - logl ( + value = ( - log ( (count + BIT_ENTROPIC_PROBABILITY_NERF) / (total + BIT_ENTROPIC_PROBABILITY_NERF)) / 0.69314718 ); d2 8 a9 8 --- crm_osb_hyperspace.c.orig 2006-09-20 22:46:46 +0200 +++ crm_osb_hyperspace.c 2006-10-09 09:44:12 +0200 @@@@ -1286,7 +1286,7 @@@@ // Proper pythagorean (Euclidean) distance - best in // SpamConf 2006 paper - dist = sqrtf (unotk + knotu) ; + dist = (double)sqrt ((double)(unotk + knotu)) ; @ 1.3.4.2 log @MFC: make up leeway for 2_STABLE by virtue of build-time results @ text @d1 12 d14 3 a16 3 --- crm_osb_hyperspace.c.orig 2006-11-03 16:19:12 +0100 +++ crm_osb_hyperspace.c 2006-11-04 20:32:00 +0100 @@@@ -1290,7 +1290,7 @@@@ @ 1.2 log @upgrading package: crm114 20040816 -> 20040820 @ text @d1 12 a12 12 Index: crm_var_hash_table.c --- crm_var_hash_table.c.orig 2004-08-16 03:17:10 +0200 +++ crm_var_hash_table.c 2004-08-16 20:38:16 +0200 @@@@ -677,7 +677,7 @@@@ crm_compress_tdw_section (oldtext, newend, oldend) + crm_compress_tdw_section(oldtext, oldstart, newstart)); } - end_of_tests: + end_of_tests: break; }; }; // @ 1.1 log @upgrading package: crm114 20040627 -> 20040815 @ text @@