@@ -1063,20 +1063,6 @@ BddCacheData copy() {
1063
1063
}
1064
1064
}
1065
1065
1066
- private static class BddCacheDataD extends BddCacheData {
1067
- double dres ;
1068
-
1069
- @ Override
1070
- BddCacheData copy () {
1071
- BddCacheDataD that = new BddCacheDataD ();
1072
- that .a = this .a ;
1073
- that .b = this .b ;
1074
- that .c = this .c ;
1075
- that .dres = this .dres ;
1076
- return that ;
1077
- }
1078
- }
1079
-
1080
1066
private static class BddCacheDataBI extends BddCacheData {
1081
1067
BigInteger bires ;
1082
1068
@@ -1098,11 +1084,8 @@ private static class BddCache {
1098
1084
1099
1085
BddCache copy () {
1100
1086
BddCache that = new BddCache ();
1101
- boolean is_d = this .table instanceof BddCacheDataD [];
1102
1087
boolean is_bi = this .table instanceof BddCacheDataBI [];
1103
- if (is_d ) {
1104
- that .table = new BddCacheDataD [this .table .length ];
1105
- } else if (is_bi ) {
1088
+ if (is_bi ) {
1106
1089
that .table = new BddCacheDataBI [this .table .length ];
1107
1090
} else {
1108
1091
that .table = new BddCacheDataI [this .table .length ];
@@ -7050,23 +7033,6 @@ BddCache BddCacheI_init(int size) {
7050
7033
return cache ;
7051
7034
}
7052
7035
7053
- BddCache BddCacheD_init (int size ) {
7054
- int n ;
7055
-
7056
- size = bdd_prime_gte (size );
7057
-
7058
- BddCache cache = new BddCache ();
7059
- cache .table = new BddCacheDataD [size ];
7060
-
7061
- for (n = 0 ; n < size ; n ++) {
7062
- cache .table [n ] = new BddCacheDataD ();
7063
- cache .table [n ].a = -1 ;
7064
- }
7065
- cache .tablesize = size ;
7066
-
7067
- return cache ;
7068
- }
7069
-
7070
7036
BddCache BddCacheBI_init (int size ) {
7071
7037
int n ;
7072
7038
@@ -7100,25 +7066,20 @@ int BddCache_resize(BddCache cache, int newsize) {
7100
7066
int n ;
7101
7067
7102
7068
boolean is_bi = cache .table instanceof BddCacheDataBI [];
7103
- boolean is_d = cache .table instanceof BddCacheDataD [];
7104
7069
7105
7070
cache .table = null ;
7106
7071
7107
7072
newsize = bdd_prime_gte (newsize );
7108
7073
7109
7074
if (is_bi ) {
7110
7075
cache .table = new BddCacheDataBI [newsize ];
7111
- } else if (is_d ) {
7112
- cache .table = new BddCacheDataD [newsize ];
7113
7076
} else {
7114
7077
cache .table = new BddCacheDataI [newsize ];
7115
7078
}
7116
7079
7117
7080
for (n = 0 ; n < newsize ; n ++) {
7118
7081
if (is_bi ) {
7119
7082
cache .table [n ] = new BddCacheDataBI ();
7120
- } else if (is_d ) {
7121
- cache .table [n ] = new BddCacheDataD ();
7122
7083
} else {
7123
7084
cache .table [n ] = new BddCacheDataI ();
7124
7085
}
@@ -7133,10 +7094,6 @@ BddCacheDataI BddCache_lookupI(BddCache cache, int hash) {
7133
7094
return (BddCacheDataI )cache .table [Math .abs (hash % cache .tablesize )];
7134
7095
}
7135
7096
7136
- BddCacheDataD BddCache_lookupD (BddCache cache , int hash ) {
7137
- return (BddCacheDataD )cache .table [Math .abs (hash % cache .tablesize )];
7138
- }
7139
-
7140
7097
BddCacheDataBI BddCache_lookupBI (BddCache cache , int hash ) {
7141
7098
return (BddCacheDataBI )cache .table [Math .abs (hash % cache .tablesize )];
7142
7099
}
0 commit comments