30%
30.11.2025
. The target systems only require the systemtap-runtime RPM and the staprun program it contains. The following command creates a prebuilt binary kernel module for the target system:
stap -r kernel-PAE-2.6.31.12-174.2.22
30%
30.11.2025
: " . $password . "\n
";
13 echo "Hash: " . $hashvalue . "\n
";
14
15 // Compare $password with the store has:
16 $passwordfromdb = '$P$9IQRaTwmfeRo7ud9Fh4E2PdI0S3r.L0';
17 // stored hash, would
30%
09.04.2019
Unexplained rename() delay: https://twitter.com/jsaryer/status/1069831718389960704
GitHub, James Saryerwinnie: https://gist.github.com/jamesls/9d52c7b3a19491f4d14c2d487515115f
rename(2) man page: https
30%
28.11.2023
location, use -B <n>; -A <n> does the same thing for lines after the find. You can search compressed text archives with -z -a and a combination of options (Figure 6
30%
05.12.2014
(HostCt, ServerOwner, Date) %>%
106 arrange(desc(HostCt))
107 head12 <- head(top12, 25)
108
109 mergedTop25 <- rbind(head1,head2,head3,head4,head5,
head6,head7,head8,head9,head10,head11,head12)
110
111
30%
25.03.2020
GVzLmlvL3NlcnZpY2VhY2NvdW50L3NlcnZpY2UtYWNjb3VudC51aWQiOiJiNDVhMDhjMi1kMzg1LTQxMmItOTUwNS02YmRmODdiNjRhN2EiLCJzdWIiOiJzeXN0ZW06c2VydmljZWFjY291bnQ6ZGVmYXVsdDp0ZXN0c2VydmljZWFjY291bnQifQ.SO9XwM3zgiW6sOfEaJx1P6
30%
05.12.2019
).
Figure 1: Flattening a 2D array in C or C++.
Listing 3
inspect.c
#include
**
int a[4][5] = { // array of 4 arrays of 5 ints each, a 4x5 matrix
{ 1, 2, 3
30%
16.01.2013
$ starcluster start -s 1 foocluster -n ami-999d49f0
$ starcluster get foocluster /opt/sge6-fresh .
$ starcluster terminate foocluster
$ starcluster start -o -s 1 -i t1.micro -n ami-e2a0058b imagehost
30%
09.01.2019
of the loop, n
, is large enough, some processing hardware can greatly speed up the computation.
What happens if z(i)
depends on a previous value, as in the following:
do i = 2,n
z(i) = z(i-1)*2
enddo
30%
22.12.2017
in cs us sy id wa st
04 1 0 0 5279852 2256 668972 0 0 1724 25 965 1042 17 9 71 2 0
05 1 0 0 5269008 2256 669004 0 0 0 0 2667 1679 28 3 69 0 0
06 1 0