Package de.torstennahm.integrate.sparse.index

Examples of de.torstennahm.integrate.sparse.index.Index

117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
    boolean calc = false;
   
    for (int i = 0; i < GridVisualizer.GRIDSIZE; i++) {
      for (int j = 0; j < GridVisualizer.GRIDSIZE; j++) {
        if (dim0 != dim1 || i == j) {
          Index index = new FastIndex();
          index = index.set(dim0, i);
          index = index.set(dim1, j);
         
          int[] pixel = positionToPixel(new int[] {i, j});
         
          EvalData data;
          synchronized (valueMap) {
            data = valueMap.get(index);
          }
          if (data == null) {
            calc = true;
          } else {
            double contribution = data.contribution;
            if (! Double.isNaN(contribution)) {
              double b = 0.0;
              double integrate = Math.abs(contribution);
              int evals = evaluator.pointsForIndex(index);
             
              if (mode == 0) {
                b = 0.7 - 0.7 * MathTN.log10(integrate) / MathTN.log10(MathTN.FUDGE);
              } else if (mode == 1) {
                b = 0.4 + 0.1 * MathTN.log10(evals);
              } else if (mode == 2) {
                b = 0.7 - 0.7 * MathTN.log10(integrate / evals) / MathTN.log10(MathTN.FUDGE);
              }
             
              g.setColor(colorScale.getColor((b + colorOffset) * colorFactor));
              g.fillRect(pixel[0], pixel[1], boxSize, boxSize);
//              if (contribution > 0) {
//                g.setColor(Color.BLACK);
//                g.fillRect(pixel[0] + (boxSize * 3) / 8, pixel[1] + (boxSize * 3) / 8, boxSize / 4, boxSize / 4);
//              }
            }
          }
        }
      }
    }
   
    g.setColor(Color.RED);
   
    for (int i = 0; i < GridVisualizer.GRIDSIZE; i++) {
      for (int j = 0; j < GridVisualizer.GRIDSIZE; j++) {
        if (dim0 != dim1 || i == j) {
          Index index = new FastIndex();           
          index = index.set(dim0, i);
          index = index.set(dim1, j);
         
          int[] pixel = positionToPixel(new int[] {i, j});
         
          boolean borderX = false, borderY = false;
          boolean evaluated;
          synchronized (indicesEvaluated) {
             evaluated = isEvaluatedInTimeLimit(index, timeLimit);
             if (! evaluated) {
              if (isEvaluatedInTimeLimit(index.add(dim0, -1), timeLimit)) {
                borderX = true;
              }
             
              if (isEvaluatedInTimeLimit(index.add(dim1, -1), timeLimit)) {
                borderY = true;
              }
             }
          }
         
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
        }
       
        if (! abort) {
          int i = k - j;
          if (task.dim0 != task.dim1 || i == j) {
            Index index = new FastIndex();
            index = index.set(task.dim0, i);
            index = index.set(task.dim1, j);
           
            boolean done = false;
           
            synchronized (task.valueMap) {
              if (task.valueMap.containsKey(index)) {
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
            throw new RuntimeException(e);
          }
        }
      }
     
      Index index = indexIter.next();
      if (! taskData.evaluatedIndices.contains(index)) {
        try {
          double value = taskData.evaluator.deltaEvaluate(index);
          double relResult = value / taskData.evaluator.pointsForIndex(index);
          synchronized (taskData.tailSet) {
View Full Code Here
227
228
229
230
231
232
233
234
235
236
237
     
      if (evaluator != null && worker != null) {
        worker.startWorker(evaluator, evaluatedIndices, tailSet);
      }
    } else if (data instanceof IndexContribution) {
      Index index = ((IndexContribution) data).index;
      double contribution = ((IndexContribution) data).contribution;
     
      double relResult = Double.NaN;
      if (evaluator != null) {
        relResult = contribution / evaluator.pointsForIndex(index);
View Full Code Here
303
304
305
306
307
308
309
310
311
312
313
      SortedSet<IndexEntry> tailSet = new TreeSet<IndexEntry>();
      FlatIndexGenerator indexIter = new FlatIndexGenerator(evaluator.dimension());
     
      long points = 0;
      while (points < numPoints) {
        Index index = indexIter.next();
       
        if (! evaluatedIndices.contains(index)) {
          try {
            double contribution = evaluator.deltaEvaluate(index);
            points += evaluator.pointsForIndex(index);
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
    }
   
    for (int i = 0; i < gridSize; i++) {
      for (int j = 0; j < gridSize; j++) {
        if (dim0 != dim1 || i == j) {
          Index index = new FastIndex();
          index = index.set(dim0, i);
          index = index.set(dim1, j);
          List<StatusData> indexList;
          synchronized (lock) {
            indexList = statusMap.get(index);
         
            if (indexList != null) {
              DecimalFormat df = new DecimalFormat("0.###E0");
             
              int[] pos = new int[] { index.get(dim0), index.get(dim1) };
              int[] pixel = positionToPixel(pos);
             
              StringBuffer statusText = new StringBuffer();
              int statusCount = 0;
              for (StatusData statusData : indexList) {
View Full Code Here
184
185
186
187
188
189
190
191
192
193
194
    synchronized (lock) {
      if (data instanceof IndexContribution) {
        time++;
      }
     
      Index index = data.index;
      StatusData statusData = new StatusData(time, data);
     
      List<StatusData> list = statusMap.get(index);
      if (list == null) {
        list = new LinkedList<StatusData>();
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
          maxDimension = dimension;
          setBarDimension(maxDimension);
        }
      }
    } else if (data instanceof IndexContribution) {
      Index index = ((IndexContribution) data).index;
      double contribution = ((IndexContribution) data).contribution;
     
      contributionPanel.indexEvaluated(index, contribution);
     
      synchronized (lock) {
        if (dimension == 0 && index.lastEntry() >= maxDimension) {
          maxDimension = index.lastEntry() + 1;
          setBarDimension(maxDimension);
        }
        indexCount++;
        timeBar.setMaximum(indexCount);
        timeBar.setValue(indexCount);
      }
     
      synchronized (lock) {
        if (index.lastEntry() >= maxDimension) {
          maxDimension = index.lastEntry() + 1;
          setBarDimension(maxDimension);
        }
      }
    }
   
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
    String statusText = "";
   
    int dim0 = dim0Bar.getValue();
    int dim1 = dim1Bar.getValue();
   
    Index v;
    synchronized (this) {
      if (! (dim0 == dim1 && x != y)) {
        EvalData data;
        v = new FastIndex();
        v = v.set(dim0, x);
        v = v.set(dim1, y);
       
        synchronized (contributionPanel.valueMap) {
          data = contributionPanel.valueMap.get(v);
        }
        if (data != null) {
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
        } else if (integrand instanceof Evaluator) {
          dimension = ((Evaluator) integrand).dimension();
        }
      }
    } else if (data instanceof IndexContribution) {
      Index index = ((IndexContribution) data).index;
      boolean repaint = false;
     
      synchronized (lock) {
        for (IntEntry entry : index) {
          if (entry.getValue() > extent.get(entry.getNumber())) {
            extent.set(entry.getNumber(), entry.getValue());
            repaint = true;
          }
        }
       
        if (index.sum() > maxSum) {
          maxSum = index.sum();
          repaint = true;
        }
      }
     
      if (repaint) {
View Full Code Here
TOP

Related Classes of de.torstennahm.integrate.sparse.index.Index

  • de.torstennahm.integrate.sparse.EstimateIntegrator$InternalIntegrator
  • de.torstennahm.integrate.sparse.EvaluateIntegrator$InternalIntegrator
  • de.torstennahm.integrate.sparse.SimplexIntegrator
  • de.torstennahm.integrate.sparse.visualize.ContributionVisualizer
  • de.torstennahm.integrate.sparse.visualize.ContributionWorker
  • de.torstennahm.integrate.sparse.visualize.ExtentVisualizer
  • de.torstennahm.integrate.sparse.visualize.GridContributionPanel
  • de.torstennahm.integrate.sparse.visualize.GridContributionWorker
  • de.torstennahm.integrate.sparse.visualize.GridStatusPanel
  • de.torstennahm.integrate.sparse.visualize.GridVisualizer
    • Copyright © 2018 www.massapicom. 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.