@Override public void actionPerformed(ActionEvent e) { DataSet ds = getLayerManager().getEditDataSet(); LinkedList<Collection<? extends OsmPrimitive>> history = ds.getSelectionHistory(); if (history == null || history.isEmpty()) return; // empty history int num = history.size(); Collection<OsmPrimitive> selection = ds.getSelected(); if (selection != null && selection.hashCode() != myAutomaticSelectionHash) { // manual selection or another pluging selection noticed index = history.indexOf(lastSel); // first is selected, next list is previous selection } int k = 0; Set<OsmPrimitive> newsel = new HashSet<>(); do { if (index + 1 < history.size()) index++; else index = 0; Collection<? extends OsmPrimitive> histsel = history.get(index); // remove deleted entities from selection newsel.clear(); newsel.addAll(histsel); newsel.retainAll(ds.allNonDeletedPrimitives()); if (newsel.size() > 0) break; k++; } while (k < num); ds.setSelected(newsel); lastSel = ds.getSelected(); myAutomaticSelectionHash = lastSel.hashCode(); // remeber last automatic selection }
/** {@inheritDoc} */ @Override public int hashCode() { final int prime = 31; int result = 1; result = (prime * result) + ((bufferStrategyConfig == null) ? 0 : bufferStrategyConfig.hashCode()); result = (prime * result) + (classCacheExistsOnCmr ? 1231 : 1237); result = (prime * result) + ((configurationInfo == null) ? 0 : configurationInfo.hashCode()); result = (prime * result) + ((exceptionSensorTypeConfig == null) ? 0 : exceptionSensorTypeConfig.hashCode()); result = (prime * result) + ((excludeClassesPatterns == null) ? 0 : excludeClassesPatterns.hashCode()); result = (prime * result) + ((initialInstrumentationResults == null) ? 0 : initialInstrumentationResults.hashCode()); result = (prime * result) + ((jmxSensorTypeConfig == null) ? 0 : jmxSensorTypeConfig.hashCode()); result = (prime * result) + ((methodSensorTypeConfigs == null) ? 0 : methodSensorTypeConfigs.hashCode()); result = (prime * result) + (int) (platformId ^ (platformId >>> 32)); result = (prime * result) + ((platformSensorTypeConfigs == null) ? 0 : platformSensorTypeConfigs.hashCode()); result = (prime * result) + ((sendingStrategyConfig == null) ? 0 : sendingStrategyConfig.hashCode()); return result; }
@JsonIgnore @Override public int hashCode() { int retval = 1; retval += sourceIp == null ? 0 : sourceIp.hashCode() * 37; retval += accessMethods == null ? 0 : accessMethods.hashCode() * 37; retval += resources == null ? 0 : resources.hashCode() * 37; return retval; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + articleID_; result = prime * result + ((assertions_ == null) ? 0 : assertions_.hashCode()); result = prime * result + ((concreteAssertions_ == null) ? 0 : concreteAssertions_.hashCode()); result = prime * result + ((infoboxType_ == null) ? 0 : infoboxType_.hashCode()); result = prime * result + minedTypes_; result = prime * result + ((standing_ == null) ? 0 : standing_.hashCode()); return result; }
@Override public int hashCode() { int result = IssueTypeId; result = 31 * result + IssueType.hashCode(); result = 31 * result + (Issue != null ? Issue.hashCode() : 0); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((deployingFaction == null) ? 0 : deployingFaction.hashCode()); result = prime * result + ((faction == null) ? 0 : faction.hashCode()); result = prime * result + ((movementModes == null) ? 0 : movementModes.hashCode()); result = prime * result + networkMask; result = prime * result + ((rating == null) ? 0 : rating.hashCode()); result = prime * result + roleStrictness; result = prime * result + ((roles == null) ? 0 : roles.hashCode()); result = prime * result + unitType; result = prime * result + ((weightClasses == null) ? 0 : weightClasses.hashCode()); result = prime * result + year; return result; }
@Override public int hashCode() { int hash = 1; hash = hash * Context.HASH_PRIME + sort.hashCode(); hash = hash * Context.HASH_PRIME + baseTerms.hashCode(); return hash; }
@Override public int hashCode() { int result = key.hashCode(); result = 31 * result + (values != null ? values.hashCode() : 0); result = 31 * result + level.hashCode(); result = 31 * result + block.hashCode(); return result; }
@Override public int hashCode() { int result = (pre ? 1 : 0); result = 31 * result + (cache != null ? cache.hashCode() : 0); result = 31 * result + (key != null ? key.hashCode() : 0); result = 31 * result + (transaction != null ? transaction.hashCode() : 0); result = 31 * result + (originLocal ? 1 : 0); result = 31 * result + (transactionSuccessful ? 1 : 0); result = 31 * result + (type != null ? type.hashCode() : 0); result = 31 * result + (value != null ? value.hashCode() : 0); result = 31 * result + (membersAtStart != null ? membersAtStart.hashCode() : 0); result = 31 * result + (membersAtEnd != null ? membersAtEnd.hashCode() : 0); result = 31 * result + (consistentHashAtStart != null ? consistentHashAtStart.hashCode() : 0); result = 31 * result + (consistentHashAtEnd != null ? consistentHashAtEnd.hashCode() : 0); result = 31 * result + ((int) newViewId); return result; }
@Override public int hashCode() { int result = (int) length; result = 31 * result + (referencing != null ? referencing.hashCode() : 0); result = 31 * result + (isPersist ? 1 : 0); result = 31 * result + (allocationMode != null ? allocationMode.hashCode() : 0); return result; }
@Override public int hashCode() { int result = (int) (idCategorieStoc ^ (idCategorieStoc >>> 32)); result = 31 * result + (codCategorie != null ? codCategorie.hashCode() : 0); result = 31 * result + (numeCategorie != null ? numeCategorie.hashCode() : 0); result = 31 * result + (parent != null ? parent.hashCode() : 0); result = 31 * result + (children != null ? children.hashCode() : 0); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((arguments_in_use == null) ? 0 : arguments_in_use.hashCode()); result = prime * result + ((mapping == null) ? 0 : mapping.hashCode()); result = prime * result + ((normal_form == null) ? 0 : normal_form.hashCode()); return result; }
/** {@inheritDoc} */ @Override public int hashCode() { int res = (int) (start ^ (start >>> 32)); res = 31 * res + (int) (len ^ (len >>> 32)); res = 31 * res + nodeIds.hashCode(); return res; }
@Override public int hashCode() { try { readLock.lock(); return delegate.hashCode(); } finally { readLock.unlock(); } }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((enabledState == null) ? 0 : enabledState.hashCode()); result = prime * result + ((ospfAreas == null) ? 0 : ospfAreas.hashCode()); result = prime * result + ((routerId == null) ? 0 : routerId.hashCode()); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((created == null) ? 0 : created.hashCode()); result = prime * result + (int) (customerId ^ (customerId >>> 32)); result = prime * result + (int) (id ^ (id >>> 32)); result = prime * result + ((positions == null) ? 0 : positions.hashCode()); return result; }
/* (non-Javadoc) * @see java.lang.Object#hashCode() */ @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((config == null) ? 0 : config.hashCode()); result = prime * result + ((graph == null) ? 0 : graph.hashCode()); result = prime * result + ((ifthenSequences == null) ? 0 : ifthenSequences.hashCode()); result = prime * result + ((testSet == null) ? 0 : testSet.hashCode()); result = prime * result + ((labelDetails == null) ? 0 : labelDetails.hashCode()); return result; }
@Override public int hashCode() { final int prime = 31; int result = super.hashCode(); result = prime * result + ((competencia == null) ? 0 : competencia.hashCode()); result = prime * result + ((dataAdmissao == null) ? 0 : dataAdmissao.hashCode()); result = prime * result + ((dataDesligamento == null) ? 0 : dataDesligamento.hashCode()); result = prime * result + ((matricula == null) ? 0 : matricula.hashCode()); result = prime * result + (situacao ? 1231 : 1237); return result; }
@Override public int hashCode() { int result = environment.hashCode(); result = 31 * result + (publicURIs.hashCode()); result = 31 * result + (alias != null ? alias.hashCode() : 0); result = 31 * result + (root != null ? root.hashCode() : 0); result = 31 * result + (roles != null ? roles.hashCode() : 0); result = 31 * result + (branches != null ? branches.hashCode() : 0); result = 31 * result + (currentBranch != null ? currentBranch.hashCode() : 0); return result; }
@Override public int hashCode() { final int prime = 31; int result = super.hashCode(); result = prime * result + (approved ? 1231 : 1237); result = prime * result + ((authorities == null) ? 0 : authorities.hashCode()); result = prime * result + ((extensions == null) ? 0 : extensions.hashCode()); result = prime * result + ((redirectUri == null) ? 0 : redirectUri.hashCode()); result = prime * result + ((resourceIds == null) ? 0 : resourceIds.hashCode()); result = prime * result + ((responseTypes == null) ? 0 : responseTypes.hashCode()); return result; }
/** * Use UnionTypeBuilder to rebuild the list of alternates and hashcode of the current UnionType. */ private void rebuildAlternates() { UnionTypeBuilder builder = new UnionTypeBuilder(registry); for (JSType alternate : alternatesWithoutStucturalTyping) { builder.addAlternate(alternate); } alternatesWithoutStucturalTyping = builder.getAlternates(); builder = new UnionTypeBuilder(registry); for (JSType alternate : alternatesWithoutStucturalTyping) { builder.addAlternate(alternate, true); } alternates = builder.getAlternates(); hashcode = alternatesWithoutStucturalTyping.hashCode(); }
@Override public int hashCode() { int result = id != null ? id.hashCode() : 0; result = 31 * result + (ssn != null ? ssn.hashCode() : 0); result = 31 * result + (firstName != null ? firstName.hashCode() : 0); result = 31 * result + (lastName != null ? lastName.hashCode() : 0); result = 31 * result + (frequentFlyerMiles != null ? frequentFlyerMiles.hashCode() : 0); result = 31 * result + (picture != null ? Arrays.hashCode(picture) : 0); result = 31 * result + (dateOfBirth != null ? dateOfBirth.hashCode() : 0); result = 31 * result + age; result = 31 * result + (lastFlight != null ? lastFlight.hashCode() : 0); result = 31 * result + (passengerType != null ? passengerType.hashCode() : 0); result = 31 * result + (preferences != null ? preferences.hashCode() : 0); result = 31 * result + (cards != null ? cards.hashCode() : 0); result = 31 * result + (address != null ? address.hashCode() : 0); result = 31 * result + (tickets != null ? tickets.hashCode() : 0); return result; }
@Override public int hashCode() { int result = encounterDateTime != null ? encounterDateTime.hashCode() : 0; result = 31 * result + (visitStartDateTime != null ? visitStartDateTime.hashCode() : 0); result = 31 * result + (targetObsRelation != null ? targetObsRelation.hashCode() : 0); result = 31 * result + (encounterTransactionObservation != null ? encounterTransactionObservation.hashCode() : 0); result = 31 * result + (groupMembers != null ? groupMembers.hashCode() : 0); result = 31 * result + (providers != null ? providers.hashCode() : 0); result = 31 * result + (isAbnormal != null ? isAbnormal.hashCode() : 0); result = 31 * result + (duration != null ? duration.hashCode() : 0); result = 31 * result + (type != null ? type.hashCode() : 0); result = 31 * result + conceptSortWeight; return result; }
public void actionPerformed(ActionEvent e) { Collection<OsmPrimitive> selection = getCurrentDataSet().getSelected(); Set<Node> selectedNodes = OsmPrimitive.getFilteredSet(selection, Node.class); getCurrentDataSet().clearSelection(selectedNodes); Command cmd = null; if (Main.main.undoRedo.commands == null) return; int num = Main.main.undoRedo.commands.size(); if (num == 0) return; int k = 0, idx; if (selection != null && !selection.isEmpty() && selection.hashCode() == lastHash) { // we are selecting next command in history if nothing is selected idx = Main.main.undoRedo.commands.indexOf(lastCmd); // System.out.println("My previous selection found "+idx); } else { idx = num; // System.out.println("last history item taken"); } Set<Node> nodes = new HashSet<Node>(10); do { // select next history element if (idx > 0) idx--; else idx = num - 1; cmd = Main.main.undoRedo.commands.get(idx); Collection<? extends OsmPrimitive> pp = cmd.getParticipatingPrimitives(); nodes.clear(); for (OsmPrimitive p : pp) { // find all affected ways if (p instanceof Node && !p.isDeleted()) nodes.add((Node) p); } if (!nodes.isEmpty()) { getCurrentDataSet().setSelected(nodes); lastCmd = cmd; // remember last used command and last selection lastHash = getCurrentDataSet().getSelected().hashCode(); return; } k++; // System.out.println("no nodes found, previous..."); } while (k < num); // try to find previous command if this affects nothing lastCmd = null; lastHash = 0; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((arrayBlockingQueue == null) ? 0 : arrayBlockingQueue.hashCode()); result = prime * result + ((arrayDeque == null) ? 0 : arrayDeque.hashCode()); result = prime * result + ((arrayList == null) ? 0 : arrayList.hashCode()); result = prime * result + ((bar == null) ? 0 : bar.hashCode()); result = prime * result + ((blockingDeque == null) ? 0 : blockingDeque.hashCode()); result = prime * result + ((blockingQueue == null) ? 0 : blockingQueue.hashCode()); result = prime * result + ((collection == null) ? 0 : collection.hashCode()); result = prime * result + ((concurrentLinkedQueue == null) ? 0 : concurrentLinkedQueue.hashCode()); result = prime * result + ((concurrentSkipListSet == null) ? 0 : concurrentSkipListSet.hashCode()); result = prime * result + ((copyOnWriteArrayList == null) ? 0 : copyOnWriteArrayList.hashCode()); result = prime * result + ((copyOnWriteArraySet == null) ? 0 : copyOnWriteArraySet.hashCode()); result = prime * result + ((deque == null) ? 0 : deque.hashCode()); result = prime * result + ((hashSet == null) ? 0 : hashSet.hashCode()); result = prime * result + ((linkedBlockingDeque == null) ? 0 : linkedBlockingDeque.hashCode()); result = prime * result + ((linkedBlockingQueue == null) ? 0 : linkedBlockingQueue.hashCode()); result = prime * result + ((linkedHashSet == null) ? 0 : linkedHashSet.hashCode()); result = prime * result + ((linkedList == null) ? 0 : linkedList.hashCode()); result = prime * result + ((list == null) ? 0 : list.hashCode()); result = prime * result + ((name == null) ? 0 : name.hashCode()); result = prime * result + ((navigableSet == null) ? 0 : navigableSet.hashCode()); result = prime * result + ((priorityBlockingQueue == null) ? 0 : priorityBlockingQueue.hashCode()); result = prime * result + ((priorityQueue == null) ? 0 : priorityQueue.hashCode()); result = prime * result + ((queue == null) ? 0 : queue.hashCode()); result = prime * result + ((set == null) ? 0 : set.hashCode()); result = prime * result + ((sortedSet == null) ? 0 : sortedSet.hashCode()); result = prime * result + ((stack == null) ? 0 : stack.hashCode()); result = prime * result + ((treeSet == null) ? 0 : treeSet.hashCode()); result = prime * result + ((vector == null) ? 0 : vector.hashCode()); return result; }
public int hashCode() { return _inner == null ? 0 : _inner.hashCode(); }
public int hashCode() { return (value == null ? 0 : value.hashCode()); }
@Override public int hashCode() { return delegate.hashCode(); }
@Override public int hashCode() { return collection.hashCode(); }
/** {@inheritDoc} */ @Override public int hashCode() { return 3 * bag.hashCode() + 5 * evaluables.hashCode(); }