View the total capacity, used capacity, remaining capacity, etc. of the attached disk, without any parameters, which is displayed by K by default.
[root@centos-01 ~]# df
//file system 1K-block Already used Available used% Mount point
/dev/sda3 29140072 1040404 28099668 4% /
Added by newbiez on Sat, 04 Apr 2020 00:39:09 +0300
css perfect break?
——Does not exist. But it can be relatively less tragic.
In css, the broken lines of the text are rather pitiful. Finally awesome version of how to operate.
Let's go to hell with word break: break all. This css can't adapt well to Chinese and English and other situations. It ...
Added by sKunKbad on Fri, 03 Apr 2020 15:25:30 +0300
The design function calculates the product and sum of two univariate polynomials.
The input is divided into two lines. Each line gives the number of nonzero terms of polynomials, and then enters a coefficient and index of nonzero terms of polynomials (the absolute value is not more than 1000 integers) in exponential descending ...
Added by Operandi on Thu, 02 Apr 2020 22:22:02 +0300
Pod security policy is critical to enhance K8S cluster security.This article will continue with the previous article on Pod security.
First, it briefly describes how to associate a Pod with a Pod security policy and uses RBAC to show the steps.It then describes how to enable the default PSP in Rancher and create a custom PSP.Finally, a tool wi ...
Added by JeDi58 on Thu, 02 Apr 2020 12:38:22 +0300
public Cursor query(boolean distinct, String table, String columns,
String selection, String selectionArgs, String groupBy,
String having, String orderBy, String limit, CancellationSignal cancellationSignal)
//distinct: set to true, each row must have u ...
Added by ChrisDarl on Thu, 02 Apr 2020 09:37:46 +0300
1. Application background
2. Structure analysis
2.1. The structure exists in the stack
2.2. The structure does not need to be released manually
3. Package heartbeat package structure
4. Structure static help class
5. Does the new structure exist in the heap or stack?
5.1. Structure without formal parameters
5.2. Structure with par ...
Added by MnM333 on Wed, 01 Apr 2020 23:41:55 +0300
[simulate strncpy], [simulate strncat], [simulate strncmp]
All three functions are implemented in bytes
char* strncpy(char* destination,const char* source,size_t num);
Copy num characters from the source character to the target space. If the length of the source string is less than num, add 0 to the back o ...
Added by jlryan on Wed, 01 Apr 2020 13:49:04 +0300
Let's take a look at the official introduction of SparseArrays
* SparseArrays map integers to Objects. Unlike a normal array of Objects,
* there can be gaps in the indices. It is intended to be more memory efficient
* than using a HashMap to map Integers to Objects, both because it avoids
* auto-boxing keys ...
Added by ElkySS on Tue, 31 Mar 2020 00:29:36 +0300
XOR is a kind of bit operator, we define that as follow: for two binary base number A and B, let C=A XOR B, then for each bit of C, we can get its value by check the digit of corresponding position in A and B. And for each digit, 1 XOR 1 = 0, 1 XOR 0 = 1, 0 XOR 1 = 1, 0 XOR 0 = 0. And we simply write this operat ...
Added by DrDankWD on Sun, 29 Mar 2020 20:28:20 +0300
You need to write a data structure (refer to the title of the title) to maintain some numbers. The following operations are required:
Insert xx number
Delete xx number (if there are more than one same number, only one will be deleted)
Query the ranking of xx numbers (the ranking is defined as the number of ...
Added by jstinehelfer on Thu, 26 Mar 2020 18:25:58 +0200