/** * Under testing, do not use just yet **/ public T getElementAtModelRowIndex(int rowModelIndex) { return this.mapElementId2ModelIndexWithThatValue.inverseBidiMap().get(rowModelIndex); }
public NetworkLayer getCanvasNetworkLayerAtVisualizationOrderRemovingNonVisible(int trueVisualizationOrder) { if (trueVisualizationOrder < 0) throw new RuntimeException(""); if (trueVisualizationOrder >= getCanvasNumberOfVisibleLayers()) throw new RuntimeException(""); return cache_mapCanvasVisibleLayer2VisualizationOrderRemovingNonVisible.inverseBidiMap().get(trueVisualizationOrder); }
public List<NetworkLayer> getCanvasLayersInVisualizationOrder(boolean includeNonVisible) { Map<Integer, NetworkLayer> map = includeNonVisible ? MapUtils.invertMap(visualizationSnapshot.getMapCanvasLayerVisualizationOrder()) : cache_mapCanvasVisibleLayer2VisualizationOrderRemovingNonVisible.inverseBidiMap(); List<NetworkLayer> res = new ArrayList<>(); for (int vIndex = 0; vIndex < this.getNetPlan().getNumberOfLayers(); vIndex++) res.add(map.get(vIndex)); return res; }
chrIndex = ondexProvider.chromBidiMap.inverseBidiMap().get(chrName); QTL qtl = new QTL(chrIndex, chrName, Long.toString(start), Long.toString(end), label); qtls.add(qtl);
public Pair<BidiMap<NetworkLayer, Integer>, Map<NetworkLayer, Boolean>> suggestCanvasUpdatedVisualizationLayerInfoForNewDesign(Set<NetworkLayer> newNetworkLayers) { final Map<NetworkLayer, Boolean> oldLayerVisibilityMap = getCanvasLayerVisibilityMap(); final BidiMap<NetworkLayer, Integer> oldLayerOrderMap = new DualHashBidiMap<>(getCanvasLayerOrderIndexMap(true)); final Map<NetworkLayer, Boolean> newLayerVisibilityMap = new HashMap<>(); final BidiMap<NetworkLayer, Integer> newLayerOrderMap = new DualHashBidiMap<>(); for (int oldVisibilityOrderIndex = 0; oldVisibilityOrderIndex < oldLayerOrderMap.size(); oldVisibilityOrderIndex++) { final NetworkLayer oldLayer = oldLayerOrderMap.inverseBidiMap().get(oldVisibilityOrderIndex); if (newNetworkLayers.contains(oldLayer)) { newLayerOrderMap.put(oldLayer, newLayerVisibilityMap.size()); newLayerVisibilityMap.put(oldLayer, oldLayerVisibilityMap.get(oldLayer)); } } final Set<NetworkLayer> newLayersNotExistingBefore = Sets.difference(newNetworkLayers, oldLayerVisibilityMap.keySet()); for (NetworkLayer newLayer : newLayersNotExistingBefore) { newLayerOrderMap.put(newLayer, newLayerVisibilityMap.size()); newLayerVisibilityMap.put(newLayer, true); // new layers always visible } return Pair.of(newLayerOrderMap, newLayerVisibilityMap); }
public final SortedSet<T> getSelectedElements() { final int[] rowViewIndexes = this.getSelectedRows(); final SortedSet<T> elements = new TreeSet<> (); if (rowViewIndexes.length != 0) { final int maxValidRowIndex = this.getModel().getRowCount() - 1 - (hasAggregationRow() ? 1 : 0); final List<Integer> validRows = new ArrayList<>(); for (int a : rowViewIndexes) if ((a >= 0) && (a <= maxValidRowIndex)) validRows.add(a); for (int rowViewIndex : validRows) { final int viewRowIndex = this.convertRowIndexToModel(rowViewIndex); final T element = this.mapElementId2ModelIndexWithThatValue.inverseBidiMap().get(viewRowIndex); if (element != null) elements.add(element); } } return elements; }
for (int trueVisualizationOrderIndex = 0; trueVisualizationOrderIndex < cache_mapCanvasVisibleLayer2VisualizationOrderRemovingNonVisible.size(); trueVisualizationOrderIndex++) final NetworkLayer newLayer = cache_mapCanvasVisibleLayer2VisualizationOrderRemovingNonVisible.inverseBidiMap().get(trueVisualizationOrderIndex); final double iconHeightIfNotActive = nodeSizeFactorRespectToDefault * (getNetPlan().getNumberOfNodes() > 100 ? VisualizationConstants.DEFAULT_GUINODE_SHAPESIZE_MORETHAN100NODES : VisualizationConstants.DEFAULT_GUINODE_SHAPESIZE); final GUINode gn = new GUINode(n, newLayer, iconHeightIfNotActive); final NetworkLayer layer = cache_mapCanvasVisibleLayer2VisualizationOrderRemovingNonVisible.inverseBidiMap().get(trueVisualizationOrderIndex); for (Link e : this.getNetPlan().getLinks(layer))
for(QTL loci : qtls) { try{ Integer qtlChrom = chromBidiMap.inverseBidiMap().get(loci.getChrName()); Long qtlStart = Long.parseLong(loci.getStart()); Long qtlEnd = Long.parseLong(loci.getEnd());
if(geneTaxID.equals(taxID) && geneChr == chromBidiMap.inverseBidiMap().get(chr) && geneBeg >= start && geneBeg <= end){ geneCount++;
final double [] y_a_min = new double [NUM_A]; for (int cont = 0 ; cont < NUM_A ; cont ++) y_a_min [cont] = Math.max(0 , (double) getMinNumDistributionCentersInLocation(cand_a.inverseBidiMap().get(cont) , 0)); final double [] y_a_max = new double [NUM_A]; for (int cont = 0 ; cont < NUM_A ; cont ++) y_a_max [cont] = Math.max(0 , (double) getMaxNumDistributionCentersInLocation(cand_a.inverseBidiMap().get(cont) , 0)); final double [] y_o_min = new double [NUM_O]; for (int cont = 0 ; cont < NUM_O ; cont ++) y_o_min [cont] = Math.max(0 , (double) getMinNumPlantsInLocation(cand_o.inverseBidiMap().get(cont) , 0)); final double [] y_o_max = new double [NUM_O]; for (int cont = 0 ; cont < NUM_O ; cont ++) y_o_max [cont] = Math.max(0 , (double) getMaxNumPlantsInLocation(cand_o.inverseBidiMap().get(cont) , 0)); final double [] h_dest = new double [NUM_D]; for (int cont = 0 ; cont < NUM_D ; cont ++) h_dest [cont] = Math.max(0, getDemandSize(cand_d.inverseBidiMap().get(cont) , 0.0)); final double [] minHDestAndMaxBlockedGoods_dest = new double [NUM_D]; for (int cont = 0 ; cont < NUM_D ; cont ++) minHDestAndMaxBlockedGoods_dest [cont] = Math.max(0, Math.min(h_dest [cont] , getMaxBlockedGoods(cand_d.inverseBidiMap().get(cont) , 0.0))); final double [] maxTraffic_p = new double [P]; for (int cont = 0 ; cont < P ; cont ++) maxTraffic_p [cont] = maxDistanceOriginToDestinationInKm.getDouble() > 0? (netPlan.getRoute(cont).getLengthInKm() > maxDistanceOriginToDestinationInKm.getDouble()? 0.0 : Double.MAX_VALUE ) : Double.MAX_VALUE; final int aIndex = cand_a.inverseBidiMap().getKey(n); setNumberOfPlacedDistributionCenters(n, (int) Math.round(y_a.get(aIndex))); final int oIndex = cand_o.inverseBidiMap().getKey(n); setNumberOfPlacedPlants(n, (int) Math.round(y_o.get(oIndex)));
final NetworkLayer neighbourLayer = layerOrderMapConsideringNonVisible.inverseBidiMap().get(defaultLayerIndex - 1); final NetworkLayer neighbourLayer = layerOrderMapConsideringNonVisible.inverseBidiMap().get(defaultLayerIndex + 1);