Understanding: Redis Foundation Types
Redis data type
zset (ordered set)
Posted on Fri, 09 Aug 2019 02:36:37 -0700 by gullit
Recently, I did some instant messaging. In order to cooperate with the use of the server (netty 4 + protobuf3), I played a trick on the ios client.
protobuf is less used in ios client, less used with cocoa AsyncSocket and less swift version.
In the swift version, there is almost no data for protobu ...
Posted on Thu, 08 Aug 2019 21:51:28 -0700 by rayden
1 ReentrantLock versus synchronized
Both ReentrantLock and synchronized are designed to synchronize locks, but ReentrantLock is more efficient and lighter than synchronized.
synchronized started with JDK1.5 and tried to optimize.By JDK1.7, the optimization efficiency has been excellent.In terms of abs ...
Posted on Thu, 08 Aug 2019 19:35:30 -0700 by kobmat
React.lazyFunctions allow you to handle dynamic imports like rendering regular components.SuspenseLoad indicators elegantly degrade components.fallbackProperty accepts whatever you want to show during component loading React Elements.
const OtherComponent = React.lazy(() => import('./OtherComponent'));
function M ...
Posted on Thu, 08 Aug 2019 02:18:20 -0700 by rklapwijk
ABSTRACT: Understanding functional programming.
Author: Front-end Wisdom
Original: Basic Principles of Functional Programming in JS
Fundebug Copyright shall be owned by the original author upon authorization to reproduce.
After learning and using object-oriented programming for a long time, let's take a step back and consider the complexity ...
Posted on Tue, 06 Aug 2019 19:34:36 -0700 by LikPan
Some people say I am not happy!
Time is running out, even if it's still a lot of water, I don't have time to complain, topic!
A tree with n nodes contributes a little to its ancestors if and only if the distance between a node and one of its ancestors is less than the point weight.
Finally a human nature \\\\\\\\\ Running every day Sim ...
Posted on Tue, 06 Aug 2019 17:57:50 -0700 by rachae1
Test score: 100
Main Algorithms: Tree DP, One Backpack
* Zero-one DP on the tree
If it is an empty node
Return the number of apples directly if it is a leaf node
If none of the above is satisfied, DP state transition
Set up DP transfer to lef ...
Posted on Tue, 06 Aug 2019 17:52:12 -0700 by direction
It has been a long time since the formal version of the coroutine was published. Compared with threads, coroutines occupy less resources and can switch threads more conveniently. Since retrofit 2.6.0, retrofit can directly support the use of OH and the protocol. Then I'll show you how to quick ...
Posted on Tue, 06 Aug 2019 01:30:27 -0700 by tjmbc
Bubble sorting (stable)
Compare the two adjacent elements in turn, and change the big ones to the back. The result of a cycle is that the largest number is at the end. Repeat the above steps (except the last one) until you have finished.
Average time complexity: O (n^2)
Optimal time complexity: O(n)
Posted on Mon, 05 Aug 2019 22:45:29 -0700 by ec
This paper explores the specific time when HashMap's linked list turns to red-black tree from three parts:
1. Statement on the threshold of "Link List to Red-Black Tree" in HashMap;2. Parse the source code of HashMap.put(K key, V value);3. Testing;
First, from the statement of HashMap about the threshold value of "link ...
Posted on Mon, 05 Aug 2019 20:37:33 -0700 by kof20012