C + + essay Nuget packaging

First, prepare all the compiled packages to a folder Like this Next, create a new text document with the suffix. nuspec Fill in content <?xml version="1.0"?> <package xmlns="http://schemas.microsoft.com/packaging/2013/05/nuspec.xsd"> <metadata> <!-- The unique identification number of the package, which is also ...

Added by tom_b on Mon, 25 Nov 2019 22:51:15 +0200

Delphi basic (operator)

I. operators1. Variable2. Operator**3. Expression   1, variables Variable explanation: the smallest storage unit (space) in programming. Its space size is determined by the data type when it is declared. 1.1 declaration: define a variable and tell Delphi the storage space of a name 1 var variable name: data type; 1.2. Variable initialization ...

Added by Drumminxx on Mon, 25 Nov 2019 22:27:10 +0200

Using the jgrapht library to manipulate graphs

In Understanding data structure graph s In learning, we learned the basic concepts of diagrams and learned them by learning. Dijkstra Shortest Path Algorithm And DFS (depth-first traversal) and BFS (breadth-first traversal) You can learn how to find the shortest path in the graph.Why study maps?In scheduling tasks, the concept of graph is used ...

Added by The Eagle on Mon, 25 Nov 2019 05:54:15 +0200

PTA bracket question

Parenthesis problem Author: Li Tingyuan Setting: China Civil Aviation Flight Institute Time limit: 400 ms Memory limit: 64 MB Code length limit: 16 KB Problem description Given a string of characters, no more than 100 characters, which may include brackets, numbers, letters, punctuation marks, and spaces, programming checks whether (), [], { ...

Added by nkyoung1 on Sun, 24 Nov 2019 23:07:07 +0200

Django template tags, inheritance and components

load and static Tags When we want to use some static resources on the page, such as pictures, js, css. At this time, we will use the static tag. For example, display a local picture in the page. Operation steps: A. create a new folder to hold static resources, such as static. To distinguish it from the following static tags, t ...

Added by rocksolidhq on Sat, 23 Nov 2019 22:31:30 +0200

[leetcode] 62 63 64 unique path & unique path II & minimum path sum

Original linkhttps://leetcode.com/problems/unique-paths/https://leetcode.com/problems/unique-paths-ii/https://leetcode.com/problems/minimum-path-sum/ Solving problems These three questions are similar, they all use dynamic programming. Among them, unique path only needs to add the number of methods to each grid; unique path II i ...

Added by algy on Sat, 23 Nov 2019 19:38:58 +0200

golang network programming form

golang_real.jpg In fact, I hate to move bricks now, but sometimes I still move bricks. If you don't move, you know you have strength. th-14.jpeg Client code Template file, the following is the client code of form submission, which may not be familiar. No more explanation. <form class="login_form" action="/login" ...

Added by Pi_Mastuh on Sat, 23 Nov 2019 16:47:56 +0200

Talk about the pullInterval of rocketmq

order This paper mainly studies the pullInterval of rocketmq pullInterval rocketmq-client-4.5.2-sources.jar!/org/apache/rocketmq/client/consumer/DefaultMQPushConsumer.java public class DefaultMQPushConsumer extends ClientConfig implements MQPushConsumer { private final InternalLogger log = ClientLogger.getLog(); //...... /** ...

Added by jrough on Sat, 23 Nov 2019 16:20:34 +0200

Talk about the SeedHostsProvider of elastic search

order This paper mainly studies the seedhosts provider of elastic search SeedHostsProvider elasticsearch-7.0.0/server/src/main/java/org/elasticsearch/discovery/SeedHostsProvider.java /** * A pluggable provider of the list of seed hosts to use for discovery. */ public interface SeedHostsProvider { /** * Returns a list of seed hosts t ...

Added by Rangel on Thu, 21 Nov 2019 22:40:15 +0200

The common ancestor problem of binary tree nodes

[problem description] Suppose the binary tree is stored in the form of binary list, root points to the root node, p and q are two different nodes in the binary tree, and they are not the points on the path from the root to the node, so we can program and solve the common ancestor which is closest to them. [input form] The fir ...

Added by smiley_kool on Wed, 20 Nov 2019 23:44:47 +0200