@Override public Queue<T> replaceAll(T currentElement, T newElement) { final io.vavr.collection.List<T> newFront = front.replaceAll(currentElement, newElement); final io.vavr.collection.List<T> newRear = rear.replaceAll(currentElement, newElement); return newFront.size() + newRear.size() == 0 ? empty() : newFront == front && newRear == rear ? this : new Queue<>(newFront, newRear); }
@Override public Queue<T> replace(T currentElement, T newElement) { final io.vavr.collection.List<T> newFront = front.replace(currentElement, newElement); final io.vavr.collection.List<T> newRear = rear.replace(currentElement, newElement); return newFront.size() + newRear.size() == 0 ? empty() : newFront == front && newRear == rear ? this : new Queue<>(newFront, newRear); }
@Override default List<T> remove(T element) { final Deque<T> preceding = new ArrayDeque<>(size()); List<T> result = this; boolean found = false; while (!found && !result.isEmpty()) { final T head = result.head(); if (Objects.equals(head, element)) { found = true; } else { preceding.addFirst(head); } result = result.tail(); } if (!found) { return this; } for (T next : preceding) { result = result.prepend(next); } return result; }
@Override default List<T> drop(int n) { if (n <= 0) { return this; } if (n >= size()) { return empty(); } List<T> list = this; for (long i = n; i > 0 && !list.isEmpty(); i--) { list = list.tail(); } return list; }
assertThat(bufferedExceptions.size()).isEqualTo(4); assertThat(bufferedExceptions.get(0)).isInstanceOf(IllegalArgumentException.class); assertThat(bufferedExceptions.get(1)).isInstanceOf(IOException.class);
@Benchmark public int dealJavaslangImmutable(Deck deck) { return deck.vavrDeckOfCardsAsImmutableList.dealHands(deck.shuffledJavaslangDeckOfCardsAsImmutableList, 5, 5) .size(); } }
@Override public Queue<T> replaceAll(T currentElement, T newElement) { final io.vavr.collection.List<T> newFront = front.replaceAll(currentElement, newElement); final io.vavr.collection.List<T> newRear = rear.replaceAll(currentElement, newElement); return newFront.size() + newRear.size() == 0 ? empty() : newFront == front && newRear == rear ? this : new Queue<>(newFront, newRear); }
@Override public Queue<T> replace(T currentElement, T newElement) { final io.vavr.collection.List<T> newFront = front.replace(currentElement, newElement); final io.vavr.collection.List<T> newRear = rear.replace(currentElement, newElement); return newFront.size() + newRear.size() == 0 ? empty() : newFront == front && newRear == rear ? this : new Queue<>(newFront, newRear); }
@Benchmark public int dealJavaslang(Deck deck) { return deck.vavrDeckOfCards.dealHands(deck.shuffledJavaslangDeckOfCards, 5, 5) .size(); }
@Benchmark public int javaSlangList(Input input) { io.vavr.collection.List<Integer> evensList = input.jsList.filter(integer -> integer % 2 == 0); return evensList.size(); }
@Benchmark public int javaSlangList(Input input) { io.vavr.collection.List<Integer> evensList = input.jsList.map(integer -> integer * 2); return evensList.size(); }
@Benchmark public int dealJavaslang() { VavrDeckOfCards deck = new VavrDeckOfCards(); io.vavr.collection.List<io.vavr.collection.Set<Card>> hands = deck.shuffleAndDeal(new Random(1), 5, 5); return hands.size(); } }
@Override default List<T> remove(T element) { final Deque<T> preceding = new ArrayDeque<>(size()); List<T> result = this; boolean found = false; while (!found && !result.isEmpty()) { final T head = result.head(); if (Objects.equals(head, element)) { found = true; } else { preceding.addFirst(head); } result = result.tail(); } if (!found) { return this; } for (T next : preceding) { result = result.prepend(next); } return result; }
@Override default List<T> drop(int n) { if (n <= 0) { return this; } if (n >= size()) { return empty(); } List<T> list = this; for (long i = n; i > 0 && !list.isEmpty(); i--) { list = list.tail(); } return list; }
if (change.tickets().size() == 1) { this.writer.append(" (Ticket: "); } else {
boolean coalesce = !isCollection(rel) && (isSingleton(rel) || linkEntry._2.size() == 1);