17%
05.12.2018
(Wikipedia, CC BY-SA 3.0).
Another option is the Newt library, which focuses on color TUIs (Figure 2) and uses a widget approach, making programming a TUI much easier. With Newt, you can create stacked
17%
17.03.2020
:
$ cat /proc/partitions|grep nvme
259 0 244198584 nvme0n1
259 3 97654784 nvme0n1p1
259 4 96679936 nvme0n1p2
I will be using partition 1 for the L2ARC read cache, so to enable
17%
10.06.2015
\
\([0-9]\+\)x\([0-9]\+\).*$/\1 \2 \3 \4 \5/p' )"
46 : connected_displays: ${connected_displays[@]}
47 : display_list: "$display_list"
48
49 if [[ -z "$display_list" ]] ; then
50 die "Could not find
17%
27.09.2021
Request timeout for icmp_seq 0
Request timeout for icmp_seq 1
Request timeout for icmp_seq 2
64 bytes from 52.90.56.122: icmp_seq=3 ttl=48
time=40.492 ms
[ output truncated ]
Welcome to Ubuntu 20.04.1 LTS
17%
17.06.2017
-1) = 0.25 * (a(1:n-2,2:n) + a(3:n,2:n) + a(2:n,1:n-2) + a(2:n,3:n))
Using forall, the same can be written as:
forall (i=2:n-1, j=2:n-1) a(i,j) = 0.25*(a(i-1,j) + a(i+1,j) + a(i,j-1) + a(i,j+1
17%
20.06.2022
.4'
02 services:
03 keycloak:
04 container_name: keycloak
05 image: quay.io/keycloak/keycloak:17.0.1
06 ports:
07 - 8080:8080
08 environment:
09 - KEYCLOAK
17%
28.11.2022
/s, 133M issued at 133M/s, 81.6M total
0B repaired, 163.06% done, no estimated completion time
scan: resilvered (draid1:3d:5c:1s-0) 20.2M in 00:00:00 with 0 errors on Mon Oct 24 17:11:22 2022
17%
18.02.2018
code is written and compiled in one of three classic HPC languages: Fortran [2], C++ [3], or C [4].
Why these languages? Because they have enabled generation of very efficient code for a long time
17%
02.06.2020
= sol.copy()
10
11 for j in range(0,ny-1):
12 sol[0,j] = 10.0
13 sol[nx-1,j] = 1.0
14 # end for
15
16 for i in range(0,nx-1):
17 sol[i,0] = 0.0
18 sol[i,ny-1] = 0.0
19 # end for
20
21 # Iterate
22
17%
02.06.2020
on a local NVMe device:
$ cat /proc/partitions|grep nvme
259 0 244198584 nvme0n1
259 3 97654784 nvme0n1p1
259 4 96679936 nvme0n1p2
I will be using partition 1 for the L2ARC read
