projects
/
demos
/
kafka
/
wordcount
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
top10: 1.1.0 - Simplified topology, using JsonSerde
[demos/kafka/wordcount]
/
src
/
main
/
java
/
de
/
juplo
/
kafka
/
wordcount
/
top10
/
Ranking.java
diff --git
a/src/main/java/de/juplo/kafka/wordcount/top10/Ranking.java
b/src/main/java/de/juplo/kafka/wordcount/top10/Ranking.java
index
b748fe5
..
80e8742
100644
(file)
--- a/
src/main/java/de/juplo/kafka/wordcount/top10/Ranking.java
+++ b/
src/main/java/de/juplo/kafka/wordcount/top10/Ranking.java
@@
-1,26
+1,26
@@
package de.juplo.kafka.wordcount.top10;
package de.juplo.kafka.wordcount.top10;
-import lombok.Getter;
-import lombok.Setter;
+import lombok.*;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
-@Getter
-@Setter
+@AllArgsConstructor(access = AccessLevel.PRIVATE)
+@NoArgsConstructor
+@Data
public class Ranking
{
private Entry[] entries = new Entry[0];
public class Ranking
{
private Entry[] entries = new Entry[0];
- public
void
add(Entry newEntry)
+ public
Ranking
add(Entry newEntry)
{
if (entries.length == 0)
{
entries = new Entry[1];
entries[0] = newEntry;
{
if (entries.length == 0)
{
entries = new Entry[1];
entries[0] = newEntry;
- return;
+ return
this
;
}
List<Entry> list = new LinkedList<>(Arrays.asList(entries));
}
List<Entry> list = new LinkedList<>(Arrays.asList(entries));
@@
-29,7
+29,7
@@
public class Ranking
Entry entry;
entry = list.get(i);
Entry entry;
entry = list.get(i);
- if (entry.getCount
() <= newEntry.getCount
())
+ if (entry.getCount
er() <= newEntry.getCounter
())
{
list.add(i, newEntry);
for (int j = i+1; j < list.size(); j++)
{
list.add(i, newEntry);
for (int j = i+1; j < list.size(); j++)
@@
-46,8
+46,15
@@
public class Ranking
list = list.subList(0,10);
}
entries = list.toArray(num -> new Entry[num]);
list = list.subList(0,10);
}
entries = list.toArray(num -> new Entry[num]);
- return;
+ return
this
;
}
}
}
}
+
+ return this;
+ }
+
+ public static Ranking of(Entry... entries)
+ {
+ return new Ranking(entries);
}
}
}
}