@@ -38,15 +38,15 @@ object JournalSequenceActor {
38
38
* Efficient representation of missing elements using NumericRanges.
39
39
* It can be seen as a collection of OrderingIds
40
40
*/
41
- case class MissingElements (elements : Seq [NumericRange [OrderingId ]]) {
41
+ private case class MissingElements (elements : Seq [NumericRange [OrderingId ]]) {
42
42
def addRange (from : OrderingId , until : OrderingId ): MissingElements = {
43
43
val newRange = from.until(until)
44
44
MissingElements (elements :+ newRange)
45
45
}
46
46
def contains (id : OrderingId ): Boolean = elements.exists(_.containsTyped(id))
47
47
def isEmpty : Boolean = elements.forall(_.isEmpty)
48
48
}
49
- object MissingElements {
49
+ private object MissingElements {
50
50
def empty : MissingElements = MissingElements (Vector .empty)
51
51
}
52
52
}
@@ -84,7 +84,7 @@ class JournalSequenceActor(readJournalDao: ReadJournalDao, config: JournalSequen
84
84
* @param moduloCounter A counter which is incremented every time a new query have been executed, modulo `maxTries`
85
85
* @param previousDelay The last used delay (may change in case failures occur)
86
86
*/
87
- def receive (
87
+ private def receive (
88
88
currentMaxOrdering : OrderingId ,
89
89
missingByCounter : Map [Int , MissingElements ],
90
90
moduloCounter : Int ,
@@ -129,7 +129,7 @@ class JournalSequenceActor(readJournalDao: ReadJournalDao, config: JournalSequen
129
129
/**
130
130
* This method that implements the "find gaps" algo. It's the meat and main purpose of this actor.
131
131
*/
132
- def findGaps (
132
+ private def findGaps (
133
133
elements : Seq [OrderingId ],
134
134
currentMaxOrdering : OrderingId ,
135
135
missingByCounter : Map [Int , MissingElements ],
0 commit comments