Detailed explanation of agency mode
1. Agent mode
Agent pattern is a design pattern that is easy to understand. Simply put, we use proxy objects instead of accessing real objects, so that we can provide additional function operations and expand the functions of the target object without modifying the original target object.
The agent mode contains three roles:
Abstract topic r ...
Posted by PC Nerd on Wed, 01 Dec 2021 08:59:27 -0800
JUC learning - atomic operation class
1, Atomic operation class in JUC
1. Introduction to atomic classes in JUC
What is atomic operation?
atomic means atom in Chinese. In chemistry, we know that atoms are the smallest unit of general matter and are inseparable in chemical reactions.
Here, atomic means that an operation is non interruptible. Even when multiple threads execute to ...
Posted by damianjames on Wed, 01 Dec 2021 07:29:34 -0800
Mybatis (II) -- mapping
1. Syntax of mapping file XXMapper.xml:
<mapper namespace="cn.kgc.mspper.UserMapper">
<select id=" findCount " ...
......
</select>
</mapper>
1.1 namespace: namespace
The name of a namespace must have the same name as an interface
1.2 id: unique identifier in namespace**
The method in the interface corresponds to ...
Posted by jdubwelch on Wed, 01 Dec 2021 05:20:17 -0800
Explain the Prototype Pattern of Java design pattern in detail
Model introduction
Prototype Pattern is used to create duplicate objects while ensuring performance. This type of design pattern is a creation pattern, which provides the best way to create objects.
In a software system, it is sometimes necessary to create a certain type of object many times. In order to simplify the creation process, you can ...
Posted by stig1 on Wed, 01 Dec 2021 04:50:46 -0800
< 2021SC@SDUSC > netty common codecs
2021SC@SDUSC
preface
Starting with this blog, we will introduce several encoders and decoders that have been implemented in netty. In this blog, we will introduce netty's LineBasedFrameDecoder class, which divides messages into different parts based on line breaks.
1, LineBasedFrameDecoder
package io.netty.handler.codec;
import io.netty ...
Posted by Gaoshan on Wed, 01 Dec 2021 03:35:51 -0800
Personal simple email website (built in SpringBoot environment)
A personal email website (built based on SpringBoot environment)
At present, you can only send some simple content. If you have any good suggestions, you can comment!!
I am still studying
Source address: https://gitee.com/mehao123/sendMail/tree/master
effect
Main interface before login
Login interface
Main interface after login
Se ...
Posted by realchamp on Wed, 01 Dec 2021 03:09:27 -0800
[Day11] three times a day
[Day11] three times a day
subject
NC58 finds two switching nodes (esay) in the binary search tree
describe
A binary tree was originally a search binary tree, but two nodes changed their positions, so that the binary tree is no longer a search binary tree. Please output the values of the two wrong nodes in ascending order. (each node has ...
Posted by Whitestripes9805 on Wed, 01 Dec 2021 01:34:12 -0800
Time complexity and space complexity
Algorithm efficiency
There are two kinds of algorithm efficiency analysis:
Time efficiency,Space efficiency.
Time efficiency - > time complexity Space efficiency - > space complexity. Time complexity mainly measures the running speed of an algorithm, while space complexity mainly measures the additional space required by an algorithm I ...
Posted by siko on Wed, 01 Dec 2021 01:27:13 -0800
Close reading of Spring source code -- in-depth analysis of the underlying principle of dynamic proxy
Previous review:
Read Spring source code (I) -- overview of refresh() method
Read the Spring source code (II) -- about the design patterns used in Spring
Dynamic proxy portal (two good articles, moving over):
What is the role of Java dynamic proxy?
Implementation and principle of java Dynamic agent
The last article combed the design patte ...
Posted by alireza on Wed, 01 Dec 2021 00:38:26 -0800
Greedy algorithm for single source shortest path (dijestra algorithm)
catalogue
1. Description of single source shortest path problem
2.Dijkstra algorithm idea
3. Specific case analysis
4. Specific code implementation
1. Description of single source shortest path problem
① Given weighted digraph G =(V,E). Where V is the set of all vertices in the graph. E is the set of all edges in the graph, and the ...
Posted by caster001 on Tue, 30 Nov 2021 22:49:01 -0800