search for: subi

...@ exception Error of string * int type regexp external compile : string -> regexp = "guestfs_int_pcre_compile" - external matches : regexp -> string -> bool = "guestfs_int_pcre_matches" - external sub : int -> string = "guestfs_int_pcre_sub" +external subi : int -> int * int = "guestfs_int_pcre_subi" let () = Callback.register_exception "PCRE.Error" (Error ("", 0)) diff --git a/common/mlpcre/PCRE.mli b/common/mlpcre/PCRE.mli index 331a50a9a..02f16d19d 100644 --- a/common/mlpcre/PCRE.mli +++ b/common/mlpcre/PCRE....

Str is a pretty ugly regexp module. Let's try to replace it with PCRE. This series of commits goes some small way towards that eventual goal. - - - I wonder if there was a deep reason why we had this? let unix2dos s = String.concat "\r\n" (Str.split_delim (Str.regexp_string "\n") s) I replaced it with what I think should be (nearly) equivalent: let unix2dos s =

...; i = 1 to num_subsamples Requires: T = cluster(X): A hierarchical clustering algorithm L = cut-tree(T; k): produces a partition with k non-singleton clusters s(L1;L2): a similarity between two partitions 1: f = 0:8 2: T =cluster(X) fthe reference clustering 3: for i = 1 to num subsamples do 4: subi =subsamp(X; f) fsub-sample a fraction f of the datag 5: Ti=cluster(subi) 6: end for 7: for k = 2 to kmax do 8: L1=cut-tree(T; k) fpartition the reference clusteringg 9: for i = 1 to maximum iterations do 10: L2 =cut-tree(Ti; k) 11: S(i; k) = s(L2;L1) computed only on the patterns of subi. 12: end...

...================================================================= RCS file: /cvs/openssh/match.c,v retrieving revision 1.18 diff -u -p -r1.18 match.c --- match.c 5 Mar 2002 01:42:43 -0000 1.18 +++ match.c 2 Aug 2002 12:13:39 -0000 @@ -135,7 +135,7 @@ match_pattern_list(const char *string, c for (subi = 0; i < len && subi < sizeof(sub) - 1 && pattern[i] != ','; subi++, i++) - sub[subi] = dolower && isupper(pattern[i]) ? + sub[subi] = dolower && isupper((unsigned)pattern[i]) ? tolower(pattern[i]) : pattern[i]; /* If subpat...

Hello R users, I'm wondering whether it is possible to manage big data set in R? I have a data set with 3 million rows and 3 columns (X,Y,Z), where X is the group id. For each X, I need to run 2 regression on the submatrix. I used the function "split": datamatrix<-read.csv("datas.csv", header=F, sep=",") dim(datamatrix) # [1] 2980523 3

...align 4 call void @llvm.xstg.memory.barrier(i32 2, i8 0) %1 = load volatile i32* @read_me, align 4 ret i32 %1 } Prior to adding our instruction itineraries the code generated was: xstg_intrinsic: # @xstg_intrinsic # BB#0: # %entry subI r509, r509, 16, 64 store r510, r509, 0, 64 bitop1 r510, r509, 0, OR, 64 store r0, r510, 12, 32 movimm r1, %hi(write_me), 64 movimmshf32 r1, r1, %lo(write_me) store r0, r1, 0, 32 fence 2 movimm r0, %hi(read_me), 64 m...

Windows usernames are case-insensitive and almost any Unicode character is allowed in a username. The user should be able to login with her username given in any case and not be refused. However, this opens up a security problem in terms of the sshd_config Match rules. The match rules for user and group names have to operate case-insensitive as well, otherwise the user can override her settings

...================================= RCS file: match.c,v retrieving revision 2.9.9.2 retrieving revision 2.9.9.2.0.1 diff -pu -r2.9.9.2 -r2.9.9.2.0.1 --- match.c 2001/07/04 04:56:46 2.9.9.2 +++ match.c 2001/09/28 18:48:11 2.9.9.2.0.1 @@ -134,7 +134,7 @@ match_hostname(const char *host, const c for (subi = 0; i < len && subi < sizeof(sub) - 1 && pattern[i] != ','; subi++, i++) - sub[subi] = isupper(pattern[i]) ? tolower(pattern[i]) : pattern[i]; + sub[subi] = isupper((unsigned char)pattern[i]) ? tolower((unsigned char)pattern[i]) : pattern[i]; /*...

v1 was here: https://www.redhat.com/archives/libguestfs/2017-September/msg00135.html This is a more complete evolution of the earlier patch. It replaces most important uses of Str with PCRE throughout the code. It also extends the bindings with some useful features like case-insensitive regexps. The main places I *didn't* touch are the generator (GObject uses Str extensively); and

...le i32* @read_me, align 4 > > ret i32 %1 > > } > > > > Prior to adding our instruction itineraries the code generated was: > > > > xstg_intrinsic: # @xstg_intrinsic > > # BB#0: # %entry > > subI r509, r509, 16, 64 > > store r510, r509, 0, 64 > > bitop1 r510, r509, 0, OR, 64 > > store r0, r510, 12, 32 > > movimm r1, %hi(write_me), 64 > > movimmshf32 r1, r1, %lo(write_me) > > store r0, r1, 0,...

....character(x$cendiv[1]),"\n") cat("number of obs used =", nrow(x),"\n") print(summary(pprfile.ppr)) } grouparr <- levels(as.factor(wintemp4$group)) pprest <- vector(mode="list",length=length(grouparr)) for(i in seq(along=grouparr)) { subi <- subset(wintemp4,wintemp4$group==grouparr[i]) if(nrow(subi) > 40) pprest[i][[1]] <- myppr1(subi) rm(subi) print(gc()) } detach(wintemp4) 2. How can one prevent "for loop" output data frame growth? On p. 178 of "S Programming" by VR, there is a sugges...

v1: https://www.redhat.com/archives/libguestfs/2017-September/msg00135.html v2: https://www.redhat.com/archives/libguestfs/2017-September/msg00158.html v3 is almost identical to v2, but I have added 4 extra commits to almost finish the job of replacing Str everywhere possible (note it's not possible to replace Str in common/mlstdutils or the generator because those are pure OCaml). As

..._int_pcre_compile" -external matches : regexp -> string -> bool = "guestfs_int_pcre_matches" +external matches : ?offset:int -> regexp -> string -> bool = "guestfs_int_pcre_matches" external sub : int -> string = "guestfs_int_pcre_sub" external subi : int -> int * int = "guestfs_int_pcre_subi" diff --git a/common/mlpcre/PCRE.mli b/common/mlpcre/PCRE.mli index eacb6fd90..e10d512fc 100644 --- a/common/mlpcre/PCRE.mli +++ b/common/mlpcre/PCRE.mli @@ -62,7 +62,7 @@ val compile : ?anchored:bool -> ?caseless:bool -> ?dotall:bool...

..._int_pcre_compile" -external matches : regexp -> string -> bool = "guestfs_int_pcre_matches" +external matches : ?offset:int -> regexp -> string -> bool = "guestfs_int_pcre_matches" external sub : int -> string = "guestfs_int_pcre_sub" external subi : int -> int * int = "guestfs_int_pcre_subi" diff --git a/common/mlpcre/PCRE.mli b/common/mlpcre/PCRE.mli index eacb6fd90..e10d512fc 100644 --- a/common/mlpcre/PCRE.mli +++ b/common/mlpcre/PCRE.mli @@ -62,7 +62,7 @@ val compile : ?anchored:bool -> ?caseless:bool -> ?dotall:bool...

After several days of operation, POP connections fail to my server. The log message is Mar 27 15:51:46 ciscy dovecot: Login process died too early - shutting down Linux ciscy.sterndata.com 2.4.22-1.2174.nptl #1 Wed Feb 18 16:38:32 EST 2004 i686 i686 i386 GNU/Linux ]# /usr/sbin/dovecot --version 0.99.10 # /etc/init.d/dovecot status dovecot (pid 6900) is running... Killing the dovecot

...n tout ou partie. Si vous avez re佺u ce message par erreur, merci d'en avertir imm侀diatement l'exp侀diteur et de le d侀truire. L'int侀grit侀 du message n'est pas assur侀e sur Internet, chaque information, y compris le nom de l'exp侀diteur pouvant 侁tre intercept侀e, modifi侀e, perdue, subir un retard dans sa transmission ou contenir des virus. L'exp侀diteur d侀cline donc toute responsabilit侀 pour toute alt侀ration, d侀formation ou falsification subie par le message au cours de sa transmission. Toute opinion contenue dans ce message appartient a son auteur et ne peut engager la r...

This series adds a new output mode for virt-v2v, called -o json. It produces local files, just like -o local, although the metadata produced is a JSON file with data that v2v collected in the conversion process. This can be useful for converting to unsupported destinations, still based on QEMU/KVM. In addition to a simple different metadata, it offers a way to relocate the disks, with

in llvm-3.6.2.src 1. when I put this around one of my instruction definitions in my target "InstrInfo.td" file, let TwoOperandAliasConstraint = "$dst = $rs1" in { } I do not see any TIED_TO in the generated GenInstrInfo.inc file for the OperandInfo used by the instruction, the question is what am I doing wrong ? 2. I've noticed that TwoOperandAliasConstraint

...tion is how can i negate the address of a symbol? Consider this piece of code: char g_var[80]; char foo(int a) { return g_var[a]; } this gets compiles into something like (in pseudo asm): addi a, g_var load retreg, a but i dont have an add with immediate instruction so i have to do the following subi a, -g_var // negate g_var addr load retreg, a A solution I thought could be passing a target flag indicating that a negation is needed when lowering the machineinstr into a MCInst, and adding a MCExpr to negate the symbol. But I want to know if there's a better way to do this, instead of delay...

...'_' + | '-' -> () + | _ -> raise (Invalid_variable var) + ) var + +let scan_variables str = + let res = ref [] in + let offset = ref 0 in + while PCRE.matches ~offset:!offset var_re str; do + let var = PCRE.sub 1 in + check_variable var; + let _, end_ = PCRE.subi 0 in + List.push_back res var; + offset := end_ + done; + List.remove_duplicates !res + +let replace_fn str fn = + let res = ref str in + let offset = ref 0 in + while PCRE.matches ~offset:!offset var_re !res; do + let var = PCRE.sub 1 in + check_variable var; + let start_, end_...