Skip to content

Commit

Permalink
Formatting fixes for Java
Browse files Browse the repository at this point in the history
  • Loading branch information
Ishan Chattopadhyaya committed Feb 19, 2025
1 parent b6a7661 commit 3380479
Show file tree
Hide file tree
Showing 3 changed files with 7 additions and 8 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -214,13 +214,13 @@ public static MemorySegment buildMemorySegment(Arena arena, float[][] data) {

public static BitSet concatenate(BitSet[] arr, int maxSizeOfEachBitSet) {
BitSet ret = new BitSet(maxSizeOfEachBitSet * arr.length);
for (int i=0; i<arr.length; i++) {
for (int i = 0; i < arr.length; i++) {
BitSet b = arr[i];
if (b == null || b.length() == 0) {
ret.set(i*maxSizeOfEachBitSet, (i+1)*maxSizeOfEachBitSet);
ret.set(i * maxSizeOfEachBitSet, (i + 1) * maxSizeOfEachBitSet);
} else {
for (int j=0; j<maxSizeOfEachBitSet; j++) {
ret.set(i*maxSizeOfEachBitSet + j, b.get(j));
for (int j = 0; j < maxSizeOfEachBitSet; j++) {
ret.set(i * maxSizeOfEachBitSet + j, b.get(j));
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -67,16 +67,15 @@ private void tmpResultsTopKWithRandomValues() throws Throwable {
BitSet[] prefilters = null;
if (usePrefilter) {
prefilters = new BitSet[numQueries];
for (int i=0; i<numQueries; i++) {
for (int i = 0; i < numQueries; i++) {
BitSet randomFilter = new BitSet(datasetSize);
for (int j=0; j<datasetSize; j++) {
for (int j = 0; j < datasetSize; j++) {
randomFilter.set(j, random.nextBoolean());
}
prefilters[i] = randomFilter;
}
}


// Generate a random dataset
float[][] dataset = generateData(random, datasetSize, dimensions);

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,7 @@ protected List<List<Integer>> generateExpectedResults(int topK, float[][] datase
List<List<Integer>> neighborsResult = new ArrayList<>();
int dimensions = dataset[0].length;

for (int q=0; q<queries.length; q++) {
for (int q = 0; q < queries.length; q++) {
float[] query = queries[q];
Map<Integer, Double> distances = new TreeMap<>();
for (int j = 0; j < dataset.length; j++) {
Expand Down

0 comments on commit 3380479

Please sign in to comment.