• IOS bottom layer exploration cache_ t


    IOS bottom Exploration Series IOS bottom layer exploration – alloc & init Exploration of IOS bottom layer – calloc and ISA IOS bottom layer exploration – class IOS bottom layer exploration cache_ t We explored it together in the last articleiOSClass’s underlying principles, of which the more important four attributes we have simply gone through, […]

  • Huawei cloud database gaussdb (for Cassandra) unveils phase 2: troubleshooting experience of abnormal memory growth


    Abstract:The abnormal growth of memory is a fatal problem for the program, because it may trigger oom, process abnormal downtime, business interruption and other results, so the reasonable planning and control of memory is particularly important. This article is shared from Huawei cloud community《Huawei cloud database gaussdb (for Cassandra) unveils phase 2: troubleshooting experience of […]

  • Using channel in. Net core (3)


    So far, we have been using the so-called “unbounded” channel. You will notice that when we create channels, we do this: var myChannel = Channel.CreateUnbounded<int>(); But actually, we can do this: var myChannel = Channel.CreateBounded<int>(1000); This is not much different from creating other collection types such as limited capacity lists or arrays. In our example, […]

  • Slice of go language foundation


    This paper mainly introduces slice in go language and its basic use. Because the length of the array is fixed and the length of the array is a part of the type, the array has many limitations. For example: func arraySum(x [3]int) int{ sum := 0 for _, v := range x{ sum = sum […]

  • HashMap interview questions


    Brief introduction of HashMap in JDK1.8 Map interface based on hash table. This implementation provides all optional mapping operations and allows null values and keys. (HashMap class is roughly equivalent to hashtable, but it is thread unsafe and allows null values) this class can’t guarantee the mapping order; in particular, it can’t guarantee that the […]

  • Leancache, an efficient memory storage service, officially released


    Leancache is a high performance, high available memory storage service for cloud engine users. Compared with our previous data storage service, it can not only handle more concurrent connections and requests, greatly improve application performance, but also reduce the cost of data storage. Leancache is suitable for scenes such as second kill, red packet grabbing, […]

  • Analysis of expansion mechanism of ArrayList source code


    Introduction to ArrayList ArrayListThe bottom layer of is array queue, which is equivalent to dynamic array. Compared with arrays in Java, its capacity can grow dynamically. Before adding a large number of elements, the application can use theensureCapacityOperation to increaseArrayListThe capacity of the instance. This can reduce the amount of incremental redistribution. ArrayListInherited fromAbstractListAnd realizedList, […]

  • Notes on data structure Deng Junhui of Tsinghua University Chapter 2


    Chapter 2 vector VectorIt is an abstraction and generalization of linear array. Starting from the most basic interface of vector, the corresponding vector template class is designed and implemented. a. Operation interface supported by vector ADT Operation interface function Applicable objects size() The current size of the report vector (total number of elements) vector get(r) […]

  • Analysis of ArrayList source code from the perspective of interview


    Note: all JDK versions used in this series arejava8 ArrayListThe class diagram is as follows: ArrayListThe bottom layer of is realized by array. The characteristics of array arefixedSize, andArrayListRealizedDynamic expansion。 ArrayListSome variables are as follows, which will be used in the following analysis. /** 1、 Initialize ArrayList initializationArrayListGenerally, the following two constructors are used 1.1 […]

  • Capacity expansion of SRAM


    SRAM is static random access memory. The so-called “static” means that as long as the memory is powered on, the data stored in it can be kept all the time, but it will be lost after power failure. Compared with DRAM (dynamic random access memory), it doesn’t need to refresh the data periodically. It’s easy […]

  • Detailed explanation of nonvolatile flash


    Flash (flash or flash memory) was first introduced by Intel in 1988. It is a nonvolatile memory that can be quickly erased and programmed by electricity. Its speed is relative to EEPROM. Flash can be divided into nor flash and NAND flash from chip technology. Nor FlashNOR flash is characterized by on-chip execution (XIP), which allows […]

  • Java foundation — source code analysis of HashMap


    1. HashMap HashMap is often used in code writing and interview process, so it is necessary to summarize its source code 1.1 attributes The default initial capacity size must be a power of 2 //The default initial capacity – MUST be a power of two. static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka […]