黑曼巴

List。

https://prometheus.io/docs/concepts/metric_types/#gauge

#正则：/.*topic=\"([^\"]+)-partition-.*/#字符串ulsar_rate_in{cluster="pulsar-cluster", instance="localhost:8085", job="pulsar_broker", namespace="yyj_tenant/yyj_ns", topic="persistent://yyj_tenant/yyj_ns/yyj1-partition-1"}#匹配结果persistent://yyj_tenant/yyj_

#在maven的settings.xml文件中配置 <mirrors> <!-- mirror | Specifies a repository mirror site to use instead of a given repository. The repository that | this mirror serves has an ID that matches the mirrorOf element of this mirror. IDs are

import java.lang.ref.WeakReference;public class WeakReferenceTest { public static void main(String[] args) throws InterruptedException { WeakReference<String> wr1 = new WeakReference<String>(new String("弱引用，如果是对象，则遇到gc将被回收；如果是非对象，

journal目录扩缩指南：https://github.com/hangc0276/bookkeeper/commit/41439eb4217f64f4d8fcbf88a72095014dc2a28d

equals比较值，如果值相等，那返回true；“==”比较的是引用，如果是同一个对象则返回true，如果是不同对象则返回false；如果是基本数据类型的数值比较，数值相同则返回true。如下测试代码：public class TestEquals { public static void main(String[] args) { Long l1 = 1L; Long l2 = 1L; Long l3 = new Long(1); .

jdk是Java开发工具包；jre是Java运行时环境；jvm是Java虚拟机；jdk里面包括jre，jre里面包括jvm

protobuf是由Google开发的一套对数据结构进行序列化的方法，可用做通信协议，数据存储格式等等。其特点是不限语言、不限平台、扩展性强。语言无关、平台无关：即 ProtoBuf 支持 Java、C++、Python 等多种语言，支持多个平台。高效：即比 XML 更小（3 ~ 10倍）、更快（20 ~ 100倍）、更为简单。扩展性、兼容性好：你可以更新数据结构，而不影响和破坏原有的旧程序。...

参考文章地址：https://zhile.io/2020/11/18/jetbrains-eval-reset-da33a93d.html1.插件市场安装在Settings/Preferences... -> Plugins内手动添加第三方插件仓库地址：https://plugins.zhile.io搜索：IDE Eval Reset插件进行安装。2.如何使用如果IDE没有打开项目，在Welcome界面点击菜单：Get Help -> Eval Reset如果IDE打开了项目，点击

待完善

java.lang.OutOfMemoryError: Java heap spacejava.lang.OutOfMemoryError: PermGen spacejava.lang.OutOfMemoryError: metaspace

待完善

一、基本原理CRC检验原理实际上就是在一个p位二进制数据序列之后附加一个r位二进制检验码(序列)，从而构成一个总长为n＝p＋r位的二进制序列；附加在数据序列之后的这个检验码与数据序列的内容之间存在着某种特定的关系。如果因干扰等原因使数据序列中的某一位或某些位发生错误，这种特定关系就会被破坏。因此，通过检查这一关系，就可以实现对数据正确性的检验。...

存储格式元素操作

package com.yyj.algorithm;public class BinarySearch { public static void main(String[] args) { int[] arr = new int[]{1, 42, 111, 119, 189, 190, 219}; System.out.println("index=" + binarySearch(arr, 1)); System.out.println("in

待完善

待完善

待完善

待完善

待完善

待完善

待完善

待完善

待完善

待完善

待完善

package java.util.concurrent;import java.util.AbstractList;import java.util.Arrays;import java.util.Collection;import java.util.Comparator;import java.util.ConcurrentModificationException;import java.util.Iterator;import java.util.List;import java.

package java.lang;import java.lang.ref.*;import java.util.Objects;import java.util.concurrent.atomic.AtomicInteger;import java.util.function.Supplier;/** * This class provides thread-local variables. These variables differ from * their normal coun

package java.nio;/** * A read/write HeapByteBuffer. */class HeapByteBuffer extends ByteBuffer{ // For speed these fields are actually declared in X-Buffer; // these declarations are here as documentation /* protected fi

待完善

package java.util.concurrent;import java.lang.Thread.UncaughtExceptionHandler;import java.util.ArrayList;import java.util.Arrays;import java.util.Collection;import java.util.Collections;import java.util.List;import java.util.concurrent.AbstractExec

package java.util.concurrent;import java.util.concurrent.locks.Condition;import java.util.concurrent.locks.ReentrantLock;/** * A synchronization aid that allows a set of threads to all wait for * each other to reach a common barrier point. CyclicBar

package java.util.concurrent.locks;import java.util.concurrent.TimeUnit;import java.util.ArrayList;import java.util.Collection;import java.util.Date;import sun.misc.Unsafe;/** * Provides a framework for implementing blocking locks and related * sy

package java.util.concurrent;import java.io.ObjectStreamField;import java.io.Serializable;import java.lang.reflect.ParameterizedType;import java.lang.reflect.Type;import java.util.AbstractMap;import java.util.Arrays;import java.util.Collection;imp

package java.util.concurrent;import java.util.*;/** * A {@link ConcurrentMap} supporting {@link NavigableMap} operations, * and recursively so for its navigable sub-maps. * * <p>This interface is a member of the * <a href="{@docRoot}/../te

package java.util.concurrent;import java.io.Serializable;import java.util.AbstractCollection;import java.util.AbstractMap;import java.util.AbstractSet;import java.util.ArrayList;import java.util.Collection;import java.util.Collections;import java..

/* * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * Written by Doug Lea with assistance from members of JCP JSR-166 * Expert Group and released to the public domain, as explained at * http://creativecommons.org/publicdomain/zer

/* * Copyright (c) 1994, 2012, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. */package java.lang;/** * Class {@code Object} is the root of the class hierarchy. * Every class

/* * Copyright (c) 1994, 2016, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. */package java.lang;import java.lang.ref.Reference;import java.lang.ref.ReferenceQueue;import jav