本文整理汇总了Java中clojure.lang.MapEntry类的典型用法代码示例。如果您正苦于以下问题：Java MapEntry类的具体用法？Java MapEntry怎么用？Java MapEntry使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
MapEntry类属于clojure.lang包，在下文中一共展示了MapEntry类的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: entryAt
import clojure.lang.MapEntry; //导入依赖的package包/类
public IMapEntry entryAt(Object key) {
int hash = Util.hasheq(key);
int h = hash;
int hops = 7;
Node node = root;
loop: for (;;) {
int shift = (h & 31)*2;
long lead = node.bitmap >>> shift;
int pos = Long.bitCount(lead);
int bits = (int) (lead & 3L);
switch (bits) {
case 0:
return null;
case 3:
Object k = node.array[pos-2];
return Util.equiv(key, k) ? new MapEntry(k, node.array[pos-1]) : null;
default:
hops--;
if (hops == 0) return Collisions.lookup(node.array[pos-1], key);
h >>>= 5;
node = (Node) node.array[pos-1];
continue loop;
}
}
}
示例2: prioritySeq
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq prioritySeq(final int countdown, final Loser losers, final Object ubound) {
if (0 == countdown)
return null;
return new LazySeq(
new AFn() {
public Object invoke() {
MatchFrame mf = new MatchFrame();
secondBest(losers, ubound, mf);
Object lkey = mf.lkey;
Object lpriority = mf.lpriority;
Loser llosers = mf.llosers;
Object lubound = mf.lubound;
return new Cons(
new MapEntry(lkey, lpriority),
prioritySeq(countdown - 1, llosers, lubound)
);
}
}
);
}
示例3: lookup
import clojure.lang.MapEntry; //导入依赖的package包/类
MapEntry lookup(Object key, Winner winner) {
if (null == winner)
return null;
if (0 == kcomp.compare(key, winner.key))
return new MapEntry(winner.key, winner.priority);
Loser losers = winner.losers;
while (null != losers) {
if (0 == kcomp.compare(key, losers.key))
return new MapEntry(losers.key, losers.priority);
if (0 < kcomp.compare(key, losers.split)) {
losers = losers.right;
continue;
}
losers = losers.left;
}
return null;
}
示例4: traverseFrom
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq traverseFrom(final Object lbound, Winner winner) {
if (null == winner)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right) {
Object lkey = match.left.key;
if (kcomp.compare(lbound, lkey) <= 0)
return RT.list(new MapEntry(lkey, match.left.priority));
return PersistentList.EMPTY;
}
final Object lubound = match.left.ubound;
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return kcomp.compare(lbound, lubound) <= 0 ?
traverseFrom(lbound, match.left) :
null;
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return traverseFrom(lbound, match.right);
}
})
);
}
示例5: rtraverseFrom
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq rtraverseFrom(final Object ubound, Winner winner) {
if (null == winner)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right) {
Object lkey = match.left.key;
if (kcomp.compare(lkey, ubound) <= 0)
return RT.list(new MapEntry(lkey, match.left.priority));
return PersistentList.EMPTY;
}
final Object lubound = match.left.ubound;
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return kcomp.compare(lubound, ubound) <= 0 ?
rtraverseFrom(ubound, match.right) :
null;
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverseFrom(ubound, match.left);
}
})
);
}
示例6: traverseAtMost
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq traverseAtMost(final Object priority, final Winner winner) {
if (null == winner || pcomp.compare(winner.priority, priority) > 0)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right)
return RT.list(new MapEntry(match.left.key, match.left.priority));
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return traverseAtMost(priority, match.left);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return traverseAtMost(priority, match.right);
}
})
);
}
示例7: traverseBelow
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq traverseBelow(final Object priority, final Winner winner) {
if (null == winner || pcomp.compare(winner.priority, priority) >= 0)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right)
return RT.list(new MapEntry(match.left.key, match.left.priority));
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return traverseBelow(priority, match.left);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return traverseBelow(priority, match.right);
}
})
);
}
示例8: rtraverseAtMost
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq rtraverseAtMost(final Object priority, Winner winner) {
if (null == winner || pcomp.compare(winner.priority, priority) > 0)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right)
return RT.list(new MapEntry(match.left.key, match.left.priority));
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverseAtMost(priority, match.right);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverseAtMost(priority, match.left);
}
})
);
}
示例9: rtraverseBelow
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq rtraverseBelow(final Object priority, Winner winner) {
if (null == winner || pcomp.compare(winner.priority, priority) >= 0)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right)
return RT.list(new MapEntry(match.left.key, match.left.priority));
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverseBelow(priority, match.right);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverseBelow(priority, match.left);
}
})
);
}
示例10: nth
import clojure.lang.MapEntry; //导入依赖的package包/类
public Object nth(int i, Object notFound) {
if (i < 0 || i >= _count)
throw new IndexOutOfBoundsException();
if (i == _count - 1)
return entryAt(winner.ubound);
Loser loser = winner.losers;
while (loser != null) {
int rank = size(loser.left);
if (i < rank) {
loser = loser.left;
continue;
} else if (i > rank) {
i -= rank + 1;
loser = loser.right;
continue;
}
return entryAt(loser.split);
}
return new MapEntry(winner.key, winner.priority);
}
示例11: nearestRight
import clojure.lang.MapEntry; //导入依赖的package包/类
public MapEntry nearestRight(Object key, boolean inclusive) {
if (null == winner)
return null;
int topc = kcomp.compare(key, winner.ubound);
if (0 == topc) {
if (inclusive)
return lookup(key, winner);
return null;
} else if (topc > 0) {
return null;
}
Object prevSplit = winner.ubound;
Loser loser = winner.losers;
while (null != loser) {
int c = kcomp.compare(key, loser.split);
if (0 == c) {
if (inclusive)
return lookup(key, winner);
loser = loser.right;
} else if (c > 0) {
loser = loser.right;
} else {
prevSplit = loser.split;
loser = loser.left;
}
}
return lookup(prevSplit, winner);
}
示例12: traverse
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq traverse(final Object key, final Object priority, Loser losers) {
if (null == losers)
return RT.list(new MapEntry(key, priority));
final Object lkey = losers.key;
final Object lpriority = losers.priority;
final Loser lleft = losers.left;
final Loser lright = losers.right;
if (kcomp.compare(lkey, losers.split) <= 0)
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return traverse(lkey, lpriority, lleft);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return traverse(key, priority, lright);
}
})
);
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return traverse(key, priority, lleft);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return traverse(lkey, lpriority, lright);
}
})
);
}
示例13: rtraverse
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq rtraverse(final Object key, final Object priority, Loser losers) {
if (null == losers)
return RT.list(new MapEntry(key, priority));
final Object lkey = losers.key;
final Object lpriority = losers.priority;
final Loser lleft = losers.left;
final Loser lright = losers.right;
if (kcomp.compare(lkey, losers.split) <= 0)
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverse(key, priority, lright);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverse(lkey, lpriority, lleft);
}
})
);
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverse(lkey, lpriority, lright);
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return rtraverse(key, priority, lleft);
}
})
);
}
示例14: traverseAtMostRange
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq traverseAtMostRange(final Object low, final Object high, final Object priority, Winner winner) {
if (null == winner || pcomp.compare(winner.priority, priority) > 0)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right) {
Object lkey = match.left.key;
if (kcomp.compare(low, lkey) <= 0 && kcomp.compare(lkey, high) <= 0)
return RT.list(new MapEntry(lkey, match.left.priority));
return PersistentList.EMPTY;
}
final Object lubound = match.left.ubound;
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return kcomp.compare(low, lubound) <= 0 ?
traverseAtMostRange(low, high, priority, match.left) :
null;
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return kcomp.compare(lubound, high) <= 0 ?
traverseAtMostRange(low, high, priority, match.right) :
null;
}
})
);
}
示例15: traverseBelowRange
import clojure.lang.MapEntry; //导入依赖的package包/类
ISeq traverseBelowRange(final Object low, final Object high, final Object priority, Winner winner) {
if (null == winner || pcomp.compare(winner.priority, priority) >= 0)
return PersistentList.EMPTY;
final Match match = unplay(winner);
if (null == match.right) {
Object lkey = match.left.key;
if (kcomp.compare(low, lkey) <= 0 && kcomp.compare(lkey, high) <= 0)
return RT.list(new MapEntry(lkey, match.left.priority));
return PersistentList.EMPTY;
}
final Object lubound = match.left.ubound;
return concat(
new LazySeq(new AFn() {
public ISeq invoke() {
return kcomp.compare(low, lubound) <= 0 ?
traverseBelowRange(low, high, priority, match.left) :
null;
}
}),
new LazySeq(new AFn() {
public ISeq invoke() {
return kcomp.compare(lubound, high) <= 0 ?
traverseBelowRange(low, high, priority, match.right) :
null;
}
})
);
}