chore: mark some utilities as internal stable (#32710)

Author: pvlugter

akka-actor/src/main/scala/akka/util/Clock.scala

@@ -19,11 +19,12 @@ import akka.actor.ExtensionId
 import akka.actor.ExtensionIdProvider
 import akka.actor.Scheduler
 import akka.annotation.InternalApi
+import akka.annotation.InternalStableApi
 
 /**
  * INTERNAL API
  */
-@InternalApi private[akka] object Clock extends ExtensionId[Clock] with ExtensionIdProvider {
+@InternalStableApi private[akka] object Clock extends ExtensionId[Clock] with ExtensionIdProvider {
   override def get(system: ActorSystem): Clock = super.get(system)
 
   override def get(system: ClassicActorSystemProvider): Clock = super.get(system)
@@ -42,7 +43,7 @@ import akka.annotation.InternalApi
 /**
  * INTERNAL API
  */
-@InternalApi private[akka] trait Clock extends Extension {
+@InternalStableApi private[akka] trait Clock extends Extension {
   def currentTime(): Long
 
   def earlierTime(duration: FiniteDuration): Long

akka-actor/src/main/scala/akka/util/RecencyList.scala

@@ -8,12 +8,12 @@ import scala.collection.immutable
 import scala.collection.mutable
 import scala.concurrent.duration.FiniteDuration
 
-import akka.annotation.InternalApi
+import akka.annotation.InternalStableApi
 
 /**
  * INTERNAL API
  */
-@InternalApi
+@InternalStableApi
 private[akka] object RecencyList {
   def emptyWithNanoClock[A]: RecencyList[A] =
     RecencyList[A](new NanoClock)
@@ -35,7 +35,7 @@ private[akka] object RecencyList {
  * Used for tracking recency of elements for implementing least/most recently used eviction policies.
  * Implemented using a doubly-linked list plus hash map for lookup, so that all operations are constant time.
  */
-@InternalApi
+@InternalStableApi
 private[akka] final class RecencyList[A] private (clock: Clock) {
   import RecencyList.Node
 

akka-actor/src/main/scala/akka/util/WildcardIndex.scala

@@ -4,9 +4,16 @@
 
 package akka.util
 
+import akka.annotation.InternalApi
+import akka.annotation.InternalStableApi
+
 import scala.annotation.tailrec
 import scala.collection.immutable.HashMap
 
+/**
+ * INTERNAL API
+ */
+@InternalStableApi
 private[akka] final case class WildcardIndex[T](
     wildcardTree: WildcardTree[T] = WildcardTree[T](),
     doubleWildcardTree: WildcardTree[T] = WildcardTree[T]()) {
@@ -37,11 +44,19 @@ private[akka] final case class WildcardIndex[T](
 
 }
 
+/**
+ * INTERNAL API
+ */
+@InternalApi
 private[akka] object WildcardTree {
   private val empty = new WildcardTree[Nothing]()
   def apply[T](): WildcardTree[T] = empty.asInstanceOf[WildcardTree[T]]
 }
 
+/**
+ * INTERNAL API
+ */
+@InternalApi
 private[akka] final case class WildcardTree[T](
     data: Option[T] = None,
     children: Map[String, WildcardTree[T]] = HashMap[String, WildcardTree[T]](),