Package cern.colt.function

Examples of cern.colt.function.IntIntProcedure

49
50
51
52
53
54
55
56
57
58
59
*
* @return <tt>true</tt> if the receiver contains the specified value.
*/
public boolean containsValue(final int value) {
  return ! forEachPair(
    new IntIntProcedure() {
      public boolean apply(int iterKey, int iterValue) {
        return (value != iterValue);
      }
    }
  );
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
  final AbstractIntIntMap other = (AbstractIntIntMap) obj;
  if (other.size() != size()) return false;

  return
    forEachPair(
      new IntIntProcedure() {
        public boolean apply(int key, int value) {
          return other.containsKey(key) && other.get(key) == value;
        }
      }
    )
    &&
    other.forEachPair(
      new IntIntProcedure() {
        public boolean apply(int key, int value) {
          return containsKey(key) && get(key) == value;
        }
      }
    );
View Full Code Here
166
167
168
169
170
171
172
173
174
175
176
*       returns <tt>Integer.MIN_VALUE</tt> if no such key exists.
*/
public int keyOf(final int value) {
  final int[] foundKey = new int[1];
  boolean notFound = forEachPair(
    new IntIntProcedure() {
      public boolean apply(int iterKey, int iterValue) {
        boolean found = value == iterValue;
        if (found) foundKey[0] = iterKey;
        return !found;
      }
View Full Code Here
252
253
254
255
256
257
258
259
260
261
262
public void pairsMatching(final IntIntProcedure condition, final IntArrayList keyList, final IntArrayList valueList) {
  keyList.clear();
  valueList.clear();
 
  forEachPair(
    new IntIntProcedure() {
      public boolean apply(int key, int value) {
        if (condition.apply(key,value)) {
          keyList.add(key);
          valueList.add(value);
        }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
*
* @return <tt>true</tt> if the receiver contains the specified value.
*/
public boolean containsValue(final int value) {
  return ! forEachPair(
    new IntIntProcedure() {
      public boolean apply(int iterKey, int iterValue) {
        return (value != iterValue);
      }
    }
  );
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
  final AbstractIntIntMap other = (AbstractIntIntMap) obj;
  if (other.size() != size()) return false;

  return
    forEachPair(
      new IntIntProcedure() {
        public boolean apply(int key, int value) {
          return other.containsKey(key) && other.get(key) == value;
        }
      }
    )
    &&
    other.forEachPair(
      new IntIntProcedure() {
        public boolean apply(int key, int value) {
          return containsKey(key) && get(key) == value;
        }
      }
    );
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
*       returns <tt>Integer.MIN_VALUE</tt> if no such key exists.
*/
public int keyOf(final int value) {
  final int[] foundKey = new int[1];
  boolean notFound = forEachPair(
    new IntIntProcedure() {
      public boolean apply(int iterKey, int iterValue) {
        boolean found = value == iterValue;
        if (found) foundKey[0] = iterKey;
        return !found;
      }
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
public void pairsMatching(final IntIntProcedure condition, final IntArrayList keyList, final IntArrayList valueList) {
  keyList.clear();
  valueList.clear();

  forEachPair(
    new IntIntProcedure() {
      public boolean apply(int key, int value) {
        if (condition.apply(key,value)) {
          keyList.add(key);
          valueList.add(value);
        }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
*
* @return <tt>true</tt> if the receiver contains the specified value.
*/
public boolean containsValue(final int value) {
  return ! forEachPair(
    new IntIntProcedure() {
      public boolean apply(int iterKey, int iterValue) {
        return (value != iterValue);
      }
    }
  );
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
  final AbstractIntIntMap other = (AbstractIntIntMap) obj;
  if (other.size() != size()) return false;

  return
    forEachPair(
      new IntIntProcedure() {
        public boolean apply(int key, int value) {
          return other.containsKey(key) && other.get(key) == value;
        }
      }
    )
    &&
    other.forEachPair(
      new IntIntProcedure() {
        public boolean apply(int key, int value) {
          return containsKey(key) && get(key) == value;
        }
      }
    );
View Full Code Here
TOP

Related Classes of cern.colt.function.IntIntProcedure

  • cern.colt.map.AbstractIntIntMap
    • 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.