设置以后需要重启 docker
sudo systemctl daemon-reload
sudo systemctl restart docker| #!/bin/bash | |
| # Get the public key | |
| # Output my public key: ApqJpFXgNnW4Cw8f8fh5sDaz1fYjqiYmWmERaAZTPM7r | |
| solana-keygen pubkey 'usb://ledger?key=0' | |
| # View the token account list | |
| spl-token accounts --owner ApqJpFXgNnW4Cw8f8fh5sDaz1fYjqiYmWmERaAZTPM7r | |
| # Close the specified token account |
| cas.authn.accept.enabled=false | |
| cas.server.name=https://sso.iresp.com:8443 | |
| cas.server.prefix=${cas.server.name}/cas | |
| logging.config=file:/etc/cas/config/log4j2.xml | |
| cas.authn.ldap[0].order=0 | |
| cas.authn.ldap[0].name=Active Directory | |
| cas.authn.ldap[0].type=AUTHENTICATED | |
| cas.authn.ldap[0].use-start-tls=false | |
| cas.authn.ldap[0].subtree-search=true | |
| # cas.authn.ldap[0].search-filter=CN={user} |
| #!/bin/sh | |
| # Get Token | |
| curl -u renfei:{password} https://ghcr.io/token\?scope\=repository:renfei/renfeid:pull | |
| # Get manifests | |
| curl "https://ghcr.io/v2/renfei/renfeid/manifests/latest" -H "Authorization: Bearer {TOKEN}" | |
| # Get blobs | |
| curl https://ghcr.io/v2/renfei/renfeid/blobs/sha256:0f3320e4e2ae41973a279c466eba6f7af49750691a7d55baabde5b47c635660f -H "Authorization: Bearer {TOKEN}" -v |
| fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name; | |
| fastcgi_param QUERY_STRING $query_string; | |
| fastcgi_param REQUEST_METHOD $request_method; | |
| fastcgi_param CONTENT_TYPE $content_type; | |
| fastcgi_param CONTENT_LENGTH $content_length; | |
| fastcgi_param SCRIPT_NAME $fastcgi_script_name; | |
| fastcgi_param REQUEST_URI $request_uri; | |
| fastcgi_param DOCUMENT_URI $document_uri; | |
| fastcgi_param DOCUMENT_ROOT $document_root; | |
| fastcgi_param SERVER_PROTOCOL $server_protocol; |
I hereby claim:
To claim this, I am signing this object:
| /** | |
| * 冒泡排序 | |
| */ | |
| static class BubbleSort { | |
| public static void main(String[] args) { | |
| int[] arr = new int[]{1, 3, 5, 0, 7, -8, 4, 1, 8, 9, 12, 2}; | |
| for (int i = 0; i < arr.length - 1; i++) { | |
| for (int j = 0; j < arr.length - 1 - i; j++) { | |
| if (arr[j] > arr[j + 1]) { | |
| // 如果左侧的比右侧的大,那么交换 |
| mvn versions:display-dependency-updates |