l.UpdatedAt = t // update to the latest time index

	if since >= 24 {
		l.Bins = [24]tierStats{}
		return
	}

	for lastIdx != idx {
		lastIdx = (lastIdx + 1) % 24
		l.Bins[lastIdx] = tierStats{}
	}
}

func (l *lastDayTierStats) clone() lastDayTierStats {
	clone := lastDayTierStats{
		UpdatedAt: l.UpdatedAt,
	}
	copy(clone.Bins[:], l.Bins[:])
	return clone
}

	// map header, size 2
	// write "Bins"
	err = en.Append(0x82, 0xa4, 0x42, 0x69, 0x6e, 0x73)
	if err != nil {
		return
	}
	err = en.WriteArrayHeader(uint32(24))
	if err != nil {
		err = msgp.WrapError(err, "Bins")
		return
	}
	for za0001 := range z.Bins {
		err = z.Bins[za0001].EncodeMsg(en)
		if err != nil {
			err = msgp.WrapError(err, "Bins", za0001)
			return
		}
	}

   * stripes, the intended concurrency level, and the typical number of keys used in a {@code
   * bulkGet(keys)} operation. See <a href="http://www.mathpages.com/home/kmath199.htm">Balls in
   * Bins model</a> for mathematical formulas that can be used to estimate the probability of
   * collisions.
   *
   * @param keys arbitrary non-null keys

cadascuns
com
contra
d'un
d'una
d'unes
d'uns
dalt
de
del
dels
des
després
dins
dintre
donat
doncs
durant
e
eh
el
els
em
en
encara
ens
entre
érem
eren
éreu
es
és
esta
està
estàvem
estaven
estàveu
esteu
et
etc
ets
fins
fora
gairebé
ha
han
has
havia
he
hem
heu
hi 
ho
i
igual
iguals

            `num_tokens`.
        *   `Discretization` added `num_bins` argument for learning bins
            boundaries through calling `adapt` on a dataset. Renamed `bins`
            argument to `bin_boundaries` for specifying bins without `adapt`.
    *   Improvements to model saving/loading:
        *   `model.load_weights` now accepts paths to saved models.

                    i++;
                } else if (s.equalsIgnoreCase("WINS")) {
                    if (nbns == null) {
                        if (LogStream.level > 1) {
                            log.println("UniAddress resolveOrder specifies WINS however the "
                                    + "jcifs.smb1.netbios.wins property has not been set");
                        }
                        continue;

    /**
     * Tests that <code>a:2.0</code> wins in the scenario:
     * <pre>
     * a:1.0
     * a:2.0
     * </pre>
     */
    @Test
    void testEqual() {
        ResolutionNode a1n = createResolutionNode(a1);
        ResolutionNode a2n = createResolutionNode(a2);

        assertResolveConflict(a2n, a1n, a2n);
    }

    /**
     * Tests that <code>a:2.0</code> wins in the scenario:
     * <pre>
     * a:2.0

   * - 2 requests happen concurrently to a host that can be coalesced onto a single connection.
   * - Both request discover no existing connection. They both make a connection.
   * - The first request "wins the race".
   * - The second request discovers it "lost the race" and closes the connection it just opened.
   * - The second request uses the coalesced connection from request1.

        return svr.equals(this.baddr) || svr.getAddress()[3] == (byte) 0xFF;
    }

    /**
     * Switches to the next available WINS server in round-robin fashion.
     *
     * @return the next WINS server address, or null if no WINS servers are configured
     */
    protected InetAddress switchWINS() {

      this
    } else {
      CertificatePinner(pins, certificateChainCleaner)
    }

  override fun equals(other: Any?): Boolean =
    other is CertificatePinner &&
      other.pins == pins &&
      other.certificateChainCleaner == certificateChainCleaner

  override fun hashCode(): Int {
    var result = 37
    result = 41 * result + pins.hashCode()