algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: format code (#4212)

Browse Source 
close #4204
This commit is contained in:
acbin
2023-06-09 18:52:05 +08:00
committed by GitHub
parent ad03086f54
commit 00282efd8b
521 changed files with 5233 additions and 7309 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
src/test/java/com/thealgorithms/datastructures/buffers/CircularBufferTest.java
View File

@@ -1,16 +1,15 @@
package com.thealgorithms.datastructures.buffers;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.RepeatedTest;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.*;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.concurrent.*;
import java.util.concurrent.atomic.AtomicIntegerArray;
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.RepeatedTest;
import org.junit.jupiter.api.Test;
class CircularBufferTest {
private static final int BUFFER_SIZE = 10;
@@ -34,25 +33,21 @@ class CircularBufferTest {
buffer.put(generateInt());
assertFalse(buffer.isFull());
for (int i = 1; i < BUFFER_SIZE; i++)
buffer.put(generateInt());
for (int i = 1; i < BUFFER_SIZE; i++) buffer.put(generateInt());
assertTrue(buffer.isFull());
}
@Test
void get() {
assertNull(buffer.get());
for (int i = 0; i < 100; i++)
buffer.put(i);
for (int i = 0; i < BUFFER_SIZE; i++)
assertEquals(i, buffer.get());
for (int i = 0; i < 100; i++) buffer.put(i);
for (int i = 0; i < BUFFER_SIZE; i++) assertEquals(i, buffer.get());
assertNull(buffer.get());
}
@Test
void put() {
for (int i = 0; i < BUFFER_SIZE; i++)
assertTrue(buffer.put(generateInt()));
for (int i = 0; i < BUFFER_SIZE; i++) assertTrue(buffer.put(generateInt()));
assertFalse(buffer.put(generateInt()));
}
@@ -119,8 +114,7 @@ class CircularBufferTest {
public List<Integer> getSortedListFrom(AtomicIntegerArray atomicArray) {
int length = atomicArray.length();
ArrayList<Integer> result = new ArrayList<>(length);
for (int i = 0; i < length; i++)
result.add(atomicArray.get(i));
for (int i = 0; i < length; i++) result.add(atomicArray.get(i));
result.sort(Comparator.comparingInt(o -> o));
return result;
}