When it comes to spin locks, we must talk about linked lists. In the previous article “Linked Lists and Structures in the Kernel”, we simply used the linked list structure to store the process information list. I believe readers should have understood it. The basic use of kernel linked lists. This article will explain the […]
Tag: struct
ST table (Spars table) of doubling ideas and data structures
ST table (Spars table) of doubling ideas and data structures **ST table is a data structure based on the idea of doubling and used to solve the problem of repeatable contribution. ** First, understand what the idea of doubling is. The doubling algorithm, as the name suggests, is to multiply by a power of 2. […]
Data structure-heap sort and its complexity calculation
Table of Contents 1. Heap sort 1.1 Adjust heap construction upward 1.2 Adjust heap construction downwards 2. Comparison of time complexity between two heap building methods 2.1 Adjust downward the time complexity of heap building 2.2 Adjust the time complexity of heap construction upward Topk problem In the previous section, we talked about Heap implementation, […]
Why use virtual environment in python? (Virtual environment function and virtual environment construction, switching, exit, migration and packaging) code demonstration. Official venv usage (**)
Detailed graphic and text explanation of python’s virtual environment (virtual environment functions and virtual environment construction, switching, exit, migration and packaging) code demonstration https://blog.csdn.net/weixin_45440484/article/details/130144943 http://www.360doc.com/content/23/0828/21/1339386_1094251670.shtml Why use a virtual environment? First, a virtual environment helps keep your projects clean and separate. You don’t have to worry about one project’s dependencies breaking another, which makes project […]
Data structure: Principle and implementation of red-black tree
Article directory Red black tree concept red black tree properties Simulation implementation of red-black tree Red-black tree balance problem Overall implementation and testing This article is used to disassemble and simulate the red-black tree, laying the foundation for subsequent map and set encapsulation. The concept of red-black trees The red-black tree is also a binary […]
“Data Structure, Algorithm and Application C++ Language Description” – Code to implement key-value ordered linked list jump list
Skip list Definition Searching in a dictionary of n number pairs described by an ordered linked list requires at most n key comparisons. If a pointer is added to the middle node of the linked list, the number of comparisons can be reduced to n/2 + 1. At this time, in order to find a […]
Hadoop 3.3.6 distributed cluster environment construction
1 System Configuration A total of 3 centOS virtual machines have been prepared, master, slave1, slave2 Configure hosts resolution vim /etc/hosts 192.168.10.11 master 192.168.10.12 slave1 192.168.10.13 slave2 Modify hostname #Execute the following commands on the corresponding server hostnamectl set-hostname master hostnamectl set-hostname slave1 hostnamectl set-hostname slave2 Turn off firewall #Close firewall systemctl stop firewalld.service #Disable […]
ZooKeeper+Kafka+ELK+Filebeat cluster construction to realize large batch log collection and display
The general process: After collecting the logs of the nginx server (web-filebeat) through filebeat, store them in the cache server kafka, and then logstash to the kafka server to retrieve the corresponding logs. After processing, they are written to the elasticsearch server and displayed on kibana. 1. Cluster environment preparation 4c/8G/100G 10.10.200.33 Kafka + ZooKeeper […]
Storage structure and query performance optimization of ClickHouse primary key index
Table of Contents Storage structure and query performance optimization of ClickHouse primary key index 1. Storage structure of primary key index 2. Query performance optimization methods 2.1. Use primary key index table 2.2. Column storage and data compression 2.3. Merge engine (MergeTree) 2.4. Data copy in conclusion Sample code: Use ClickHouse for e-commerce sales data […]
Valgrind reports error disInstr(arm): unhandled instruction: 0xEC510F1E
Directory title Problem background specific reason The principle behind Conclusion Problem background When using cross-compiled Valgrind on the arm platform to monitor your own process, you will find that processes that rely on libcrypto will report an error. Roughly as follows ==20393== Memcheck, a memory error detector ==20393== Copyright (C) 2002-2022, and GNU GPL’d, by […]