All Downloads are FREE. Search and download functionalities are using the official Maven repository.

dev.tauri.choam.data.Counter.scala Maven / Gradle / Ivy

The newest version!
/*
 * SPDX-License-Identifier: Apache-2.0
 * Copyright 2016-2024 Daniel Urban and contributors listed in NOTICE.txt
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package dev.tauri.choam
package data

// TODO: elimination counter (what do with different add values?)
// TODO: something like LongAdder (no atomic `get`, but fast)
// TODO: do some benchmarks (`val`s may not worth it)

final class Counter private (ref: Ref[Long]) {

  val add: Rxn[Long, Long] = ref.upd[Long, Long] { (cnt, n) =>
    (cnt + n, cnt)
  }

  val incr: Axn[Long] =
    add.provide(1L)

  val decr: Axn[Long] =
    add.provide(-1L)

  val count: Axn[Long] =
    ref.get
}

object Counter {

  def apply: Axn[Counter] =
    Ref.padded(0L).map(new Counter(_))

  private[data] def unsafe(initial: Long = 0L): Counter =
    new Counter(Ref.unsafePadded(initial))
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy