PG Database Source-SysCache Partial Matching Mechanism

The catcache code is located at src/backend/utils/cache/catcache.c, which contains links and operations to initialize SysCache structures and pointer relationships between data structures. Finding tuples in CatCache There are two ways to find tuples in a CatCache: exactly matching the SearchCatCache and partially matching the SearchCatcac ...

Posted by hanhao on Thu, 10 Mar 2022 19:05:13 +0100

Deadlock and deadlock detection

1, What is a deadlock For example, if thread a occupies resource 1, thread b occupies resource 2, thread b needs resource 1 and thread a needs resource 2, a deadlock will occur In the deadlock solution, log and gdb debugging can be used when the number of threads is small log and gdb cannot be used to solve the problem of too many thre ...

Posted by pentinat on Thu, 10 Mar 2022 17:25:19 +0100

ffmpeg multi-threaded simple player-carding of main functions

Mainly the next few functions First is the basic definition of the main function VideoState *is; is = av_mallocz(sizeof(VideoState)); if(SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO | SDL_INIT_TIMER)) { fprintf(stderr, "Could not initialize SDL - %s\n", SDL_GetError()); exit(1); } is->pictq_mutex = SDL_CreateMutex(); is-&gt ...

Posted by reece_1989 on Thu, 10 Mar 2022 19:27:05 +0100

[JAVA refined into immortality] magic chapter -- object oriented ② (inheritance, construction method, rewriting, overloading)

🔎 This is JAVA Chengxian road. Pay attention to my learning JAVA and don't get lost 👍 If it helps you, give the blogger a free praise to show encouragement Welcome 🔎 give the thumbs-up 👍 Comment collection ⭐ ️ This chapter introduces the construction method, inheritance, rewriting, overloading and creation method in detail. The whole arti ...

Posted by bsamson on Thu, 10 Mar 2022 21:04:59 +0100

Several sorting methods of arrays

Quick sort Quick sorting embodies the idea of divide and conquer. Determine the final position of a number each time, place it in the correct position, and then quickly sort the arrays at both ends in the same way through recursion. It should be noted that when using quick sort, the decision number needs to be taken randomly, which is called ...

Posted by ferronrsmith on Thu, 10 Mar 2022 17:33:18 +0100

0 basic society on the dynamic planning of editing distance (with C + + source code)

catalogue Question 1: judgment subsequence Question 2: different subsequences Question 3: deletion of two strings Question 4: editing distance Today, we continue to study the algorithm problems of dynamic programming, which are a series of algorithm problems about finding editing distance. Let's make a summary. I'll copy these problems t ...

Posted by social_experiment on Thu, 10 Mar 2022 21:51:02 +0100