Examples of HashOverflowException

Examples of net.openhft.koloboke.collect.hash.HashOverflowException

102
103
104
105
106
107
108
109
        if (simpleArrays && currentSize - Integer.MAX_VALUE < 0) {
            // Also prime, but likely will cause to OutOfMemoryError
            return Integer.MAX_VALUE;
        } else {
            // DHash must have at least 1 free slot
            throw new HashOverflowException();
        }
    }
View Full Code Here

Examples of net.openhft.koloboke.collect.hash.HashOverflowException

124
125
126
127
128
129
130
131
        if (simpleArrays && currentSize - Integer.MAX_VALUE < 0) {
            // Integer.MAX_VALUE is also a qHash prime, but likely will cause OutOfMemoryError
            return Integer.MAX_VALUE;
        } else {
            // QHash must have at least 1 free slot
            throw new HashOverflowException();
        }
    }
View Full Code Here

Examples of net.openhft.koloboke.collect.hash.HashOverflowException

138
139
140
141
142
143
144
145
146
147
148
        int mc = modCount();
        int size = size();
        if (size >= BYTE_CARDINALITY -
                /* if Mutable mutability && !(LHash hash) */2
                /* elif !(Mutable mutability) || LHash hash //1// endif */) {
            throw new HashOverflowException();
        }
        /* endif */
        byte free = this.freeValue;
        /* if Mutable mutability && !(LHash hash) */byte removed = this.removedValue;/* endif */
        Random random = ThreadLocalRandom.current();
View Full Code Here

Examples of net.openhft.koloboke.collect.hash.HashOverflowException

293
294
295
296
297
298
299
300
301
            if (tryRehashForExpansion(grownCapacity()))
                return;
        }
        if (--freeSlots < minFreeSlots) {
            if (!tryRehashIfTooFewFreeSlots() && freeSlots == 0) {
                throw new HashOverflowException();
            }
        }
    }
View Full Code Here

Examples of ru.autosome.ape.model.exception.HashOverflowException

38
39
40
41
42
43
44
45
46
47
48
  protected ScoreDistributionTop score_distribution_above_threshold(double threshold) throws HashOverflowException {
    TDoubleDoubleMap scores = initialCountDistribution();
    for (int pos = 0; pos < pwm.length(); ++pos) {
      scores = recalc_score_hash(scores, pwm.matrix[pos], threshold - pwm.best_suffix(pos + 1));
      if (exceedHashSizeLimit(scores)) {
        throw new HashOverflowException("Hash overflow in PWM::ThresholdByPvalue#score_distribution_above_threshold");
      }
    }
    ScoreDistributionTop result = new ScoreDistributionTop(scores, vocabularyVolume(), threshold);
    result.setWorstScore(pwm.worst_score());
    result.setBestScore(pwm.best_score());
View Full Code Here

Examples of ru.autosome.ape.model.exception.HashOverflowException

90
91
92
93
94
95
96
97
98
99
100
                                 firstColumn, secondColumn,
                                 leastSufficientScoresFirst, leastSufficientScoresSecond,
                                 background);

      if (maxPairHashSize != null && summarySize(scores) > maxPairHashSize) {
        throw new HashOverflowException("Hash overflow in AlignedModelIntersection#get_counts");
      }
    }

    return combine_scores(scores);
  }
View Full Code Here

Examples of ru.autosome.ape.model.exception.HashOverflowException

46
47
48
49
50
51
52
53
54
55
56
      for (int letter = 0; letter < 4; ++letter) {
        least_sufficient[letter] = threshold - dipwm.best_suffix(column + 1, letter);
      }
      scores = recalc_score_hash(scores, dipwm.matrix[column], least_sufficient);
      if (exceedHashSizeLimit(scores)) {
        throw new HashOverflowException("Hash overflow in DiPWM::ThresholdByPvalue#score_distribution_above_threshold");
      }
    }

    TDoubleDoubleMap score_count_hash = combine_scores(scores);
    ScoreDistributionTop result = new ScoreDistributionTop(score_count_hash, vocabularyVolume(), threshold);
View Full Code Here

Examples of ru.autosome.ape.model.exception.HashOverflowException

64
65
66
67
68
69
70
71
72
73
74
                                   leastSufficientScoreFirst, leastSufficientScoreSecond,
                                   background);
      }

      if (maxPairHashSize != null && summarySize(scores) > maxPairHashSize) {
        throw new HashOverflowException("Hash overflow in AlignedModelIntersection#get_counts");
      }
    }

    return combine_scores(scores);
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.