Fixed external links akka-protobuf and akka-remote (#31038)

* Fixed external links akka-protobuf and akka-remote

* Fixed external links akka-remote

* Updated the outdated links akka-remote
This commit is contained in:
purvaagrawal25 2022-01-06 21:10:42 +05:30 committed by GitHub
parent 088b63be1a
commit 3f98276195
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
5 changed files with 6 additions and 6 deletions

View file

@ -373,7 +373,7 @@ public abstract class ByteString implements Iterable<Byte> {
* Concatenate the given {@code ByteString} to this one. Short concatenations, * Concatenate the given {@code ByteString} to this one. Short concatenations,
* of total size smaller than {@link ByteString#CONCATENATE_BY_COPY_SIZE}, are * of total size smaller than {@link ByteString#CONCATENATE_BY_COPY_SIZE}, are
* produced by copying the underlying bytes (as per Rope.java, <a * produced by copying the underlying bytes (as per Rope.java, <a
* href="http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol25/issue12/spe986.pdf"> * href="https://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol25/issue12/spe986.pdf">
* BAP95 </a>. In general, the concatenate involves no copying. * BAP95 </a>. In general, the concatenate involves no copying.
* *
* @param other string to concatenate * @param other string to concatenate

View file

@ -53,7 +53,7 @@ import java.util.Stack;
* represented as a tree whose leaf nodes are each a {@link LiteralByteString}. * represented as a tree whose leaf nodes are each a {@link LiteralByteString}.
* *
* <p>Most of the operation here is inspired by the now-famous paper <a * <p>Most of the operation here is inspired by the now-famous paper <a
* href="http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol25/issue12/spe986.pdf"> * href="https://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol25/issue12/spe986.pdf">
* BAP95 </a> Ropes: an Alternative to Strings hans-j. boehm, russ atkinson and * BAP95 </a> Ropes: an Alternative to Strings hans-j. boehm, russ atkinson and
* michael plass * michael plass
* *

View file

@ -21,7 +21,7 @@ import akka.util.Helpers.ConfigOps
/** /**
* Implementation of 'The Phi Accrual Failure Detector' by Hayashibara et al. as defined in their paper: * Implementation of 'The Phi Accrual Failure Detector' by Hayashibara et al. as defined in their paper:
* [http://www.jaist.ac.jp/~defago/files/pdf/IS_RR_2004_010.pdf] * [https://oneofus.la/have-emacs-will-hack/files/HDY04.pdf]
* *
* The suspicion level of failure is given by a value called φ (phi). * The suspicion level of failure is given by a value called φ (phi).
* The basic idea of the φ failure detector is to express the value of φ on a scale that * The basic idea of the φ failure detector is to express the value of φ on a scale that

View file

@ -16,8 +16,8 @@ private[akka] case class CacheStatistics(entries: Int, maxProbeDistance: Int, av
* INTERNAL API * INTERNAL API
* *
* This class is based on a Robin-Hood hashmap * This class is based on a Robin-Hood hashmap
* (http://www.sebastiansylvan.com/post/robin-hood-hashing-should-be-your-default-hash-table-implementation/) * (https://www.sebastiansylvan.com/post/robin-hood-hashing-should-be-your-default-hash-table-implementation/)
* with backshift (http://codecapsule.com/2013/11/17/robin-hood-hashing-backward-shift-deletion/). * with backshift (https://codecapsule.com/2013/11/17/robin-hood-hashing-backward-shift-deletion/).
* *
* The main modification compared to an RH hashmap is that it never grows the map (no rehashes) instead it is allowed * The main modification compared to an RH hashmap is that it never grows the map (no rehashes) instead it is allowed
* to kick out entires that are considered old. The implementation tries to keep the map close to full, only evicting * to kick out entires that are considered old. The implementation tries to keep the map close to full, only evicting

View file

@ -16,7 +16,7 @@ import scala.reflect.ClassTag
* *
* Keeps a number of specific heavy hitters around in memory. * Keeps a number of specific heavy hitters around in memory.
* *
* See also Section 5.2 of http://dimacs.rutgers.edu/~graham/pubs/papers/cm-full.pdf * See also Section 5.2 of https://dimacs.rutgers.edu/~graham/pubs/papers/cm-full.pdf
* for a discussion about the assumptions made and guarantees about the Heavy Hitters made in this model. * for a discussion about the assumptions made and guarantees about the Heavy Hitters made in this model.
* We assume the Cash Register model in which there are only additions, which simplifies HH detection significantly. * We assume the Cash Register model in which there are only additions, which simplifies HH detection significantly.
* *