• C language – if you are not a programmer, you will never understand these three symbols! (= and = =,! =)


    1. =: In C language, the equal sign (=) is the assignment operator. The following is a brief description of the use of the assignment operator 1) Assignment of variables: inta; a = 10; Here is the assignment of 10 to A. after the assignment, the value of a is 10 2) Assignment of pointer […]

  • Balanced tree


    1、 DefinitionBalanced tree is the combination of search tree and heapA balanced tree is an empty tree or the height difference between its left and right subtrees is no more than 1, and both the left and right subtrees are balanced binary trees.Difference between balanced tree and binary search tree: the balanced tree itself is […]

  • Golang learning – how to determine whether the golang interface is implemented?


    Series articles: Golang learning — constants const and iota Golang learning — the difference between array pointer and pointer array Golang learning – structure (I) Golang learning – structure (II) Golang learning – Interface learning (I) Golang learning – how to determine whether the golang interface is implemented? Golang learning – Interface learning (II) Golang […]

  • Rust programming video tutorial (Advanced) – 010_ 1box introduction


    Video address Headline address:https://www.ixigua.com/i677586170644791348…Station B address:https://www.bilibili.com/video/av81202308/ Explanation content 1. The simplest and most direct smart pointer is box, which is of type box. Box allows values to be placed on the heap instead of the stack, leaving a pointer to the heap data on the stack. Except that the data is stored on the heap, […]

  • Java NIO – Buffer


    structure Buffer means “buffer”. In Java NiO, all data must pass through the buffer. The following figure shows the basic structure inside the buffer. It is actually an array with three pointers: position, limit and capacity. capacity capacityThe capacity for this array is immutable. limit limitIs the subscript of the first unreadable element in the […]

  • Redis linked list implementation


    //Each linked list node uses a listnode structure to represent a typedef struct listnode{ //Front node struct ListNode *prev; //Post node struct ListNode *next; //Node value void *value; } ListNode;    // typedef struct List{ //Head node struct ListNode *head; //Tail node struct ListNode *tail; //Number of nodes contained in the linked list unsigned long […]

  • Use c# but not GC? Preface


    Summary of this article Since the timing of GC is uncontrollable and may destroy specific types of game experience, the use of GC should be reduced or even not used at all; adoptMarshal.AllocHGlobalandMarshal.FreeHGlobalAllocate and use unmanaged memory; adoptGCHandleMix managed and unmanaged types; How to build complex struct objects in unmanaged memory motivation Some game types […]

  • C + + basic summary


    C++Syntax basis (data type, operator, program flow structure, array, function, pointer, structure) 1. Introduction to C + + 1.1 standard code format #include<iostream> using namespace std; int main() { cout << “Hello world” << endl; system(“pause”); return 0; } 1.2 notes effect: add some instructions and explanations in the code to facilitate yourself or other […]

  • Should the method be declared on T or * t


    Friendly tips: This article takes about 3 minutes and 49 seconds to read. Please give more advice on the shortcomings. Thank you for reading. Subscribe to this site Should methods be declared on T or * t – David In go, for any type T, there is a type * t, which is the result […]

  • Interviewer: why should MySQL index use B + tree instead of other trees? Like B tree?


    How many rows of data can be stored in a B + tree of InnoDB? answer:About 20 million Why so much? Because this can be calculated, to find out this problem, start with the InnoDB index data structure and data organization. When a computer stores data, it has the smallest storage unit, just as the […]

  • Conversion principle of string and [] byte in go language


    preface Hello, everyone, I’masong。 Why is there today’s article? I saw one in a group the day before yesterdayGoIn the eight part essay of the language interview, one of the questions is “will memory copy occur when a string is converted into a byte array?”; This question is very interesting. The essence is to ask […]

  • Interpretation of Vue source code IV: ast abstract syntax tree


    The content of this article istemplate engineOn the basis ofVirtual DOMBased on the relationship between the three, the following figure is summarized: graph TD A [template syntax] – > | parsing | B (abstract syntax tree AST) B — > | call | C [rendering function is h function] C — > | generate | […]