Qt learning notes

1, Start with Hello World Cited examples #include <QApplication> #include <QLabel> int main(int argc, char* argv[]) { //Creating a QApplication instance is essential QApplication app(argc, argv); //Create a QLabel instance and assign Hello, world text to the constructor so that this text can be displayed on QLabe ...

Posted by ahsan on Wed, 09 Feb 2022 01:19:27 +0100

Introduction to interprocess communication (IPC)

I Why do I need interprocess communication 1). data transmission One process needs to send its data to another process. 2). resource sharing Multiple processes share the same resources. 3). Notification event A process needs to send a message to another process or group of processes to inform them of an event. 4). Process control Some p ...

Posted by swallace on Wed, 09 Feb 2022 00:45:55 +0100

openMVG source code learning main_SfMInit_ImageListing

openMVG source code learning (I) main_SfMInit_ImageListing This study note will use openmvg as the third-party library, the method of restoring motion structure recommended in the official documents, the meaning of the code and the experience I found in my study. Welcome to discuss! Code and platform included ubuntu18.04 The installation of ...

Posted by cesarcesar on Wed, 09 Feb 2022 00:03:10 +0100

www.etiger.vip DEVC + + Practice (Introduction)

First question, #Include < iostream > / / call out the streaming toolbox using namespace std;   //Use normal namespace int main(){            //Start main program     long long a,b;     //Define integer variables a, b     cin>>a;            //Enter and assign to integer variable a     cin>>b;            //Enter and assign to ...

Posted by jesirose on Tue, 08 Feb 2022 22:10:36 +0100

Necessary basic knowledge from c to c + +

First of all, we must know that c + + is compatible with c syntax, which syntax is suitable for use, and which one Before we start learning a language, type a line of hello world in c + + syntax #include<ostream> using namespace std; int main() { cout << "hello word" << endl; return 0; } Here we can see that c + + needs ...

Posted by biodrux on Tue, 08 Feb 2022 20:38:26 +0100

Xinao 1215: maze (explain the restoration of tag array in detail)

1215: Maze Time limit: 1000 ms memory limit: 65536 KB [Title Description] One day, while exploring in the forest, extende accidentally walked into a maze, which can be seen as a maze by n × n Each grid point has only two states And #, the former means passable, and the latter means impassable. At the same time, when extend is at A ...

Posted by t31os on Tue, 08 Feb 2022 17:34:13 +0100

Flood Fill algorithm of common algorithm

Flood Fill algorithm of common algorithm Algorithm Introduction Basic function: find connected blocksBasic method: BFS searchApplicable topics: it is necessary to find out the topics of classification blocks / some clustering problemsAs the name suggests, Flood Fill algorithm is to find the surrounding qualified areas like flooding. BFS can b ...

Posted by DepretioN on Tue, 08 Feb 2022 15:44:16 +0100

FP-21 functional programming

Lecture 21 functional programming imperative programming Procedural and object-oriented programming belong to the imperative programming paradigm "How to do" needs to be described in detail, including operation steps and state changes. They are consistent with von Neumann architecture. They are widely used programming paradigms a ...

Posted by lexx on Tue, 08 Feb 2022 10:54:54 +0100

Experiment 3 derived class and inheritance experiment

Experiment 3: derived class and inheritance experiment 1. Experimental purpose (1) Master the declaration method of derived class and the definition method of derived class constructor; (2) Master the access properties of base class members in derived classes under different inheritance methods; (3) Master the execution order and con ...

Posted by jplock on Tue, 08 Feb 2022 09:30:28 +0100

Operating system process scheduling priority scheduling algorithm and time slice rotation algorithm

1, Experiment contents and requirements Priority law, rotation law Simplified assumptions 1) The process is computational (no I/O) 2) Process status: ready, running, finish 3) The CPU time required by the process is determined in time slicesAlgorithm description 1) Priority law - dynamic priority When the current running process runs out of ti ...

Posted by jnuneznyc on Tue, 08 Feb 2022 07:44:07 +0100