Displaying 6 results from an estimated 6 matches for "nexact".
Did you mean:
exact
2009 Nov 16
1
No Visible Binding for global variable
...ply here. The entire code for both functions is below, but the only place the variable "Zobs" appears in the function cheat.fit is:
cheaters <- cbind(data.frame(cheaters), exactMatch)
names(cheaters)[1] <- 'Zobs'
names(cheaters)[2] <- 'Nexact'
cheaters$Zcrit <- Zcrit
cheaters$Mean <- means
cheaters$Var <- vars
cheaters <- subset(cheaters, Zobs >= Zcrit)
result <- list("pairs" = c(row.names(cheaters)), "Ncheat" = nro...
2008 Jul 12
4
[PATCH] tun: Fix/rewrite packet filtering logic
...u32 *mask, const u8 *addr)
+{
+ int n = ether_crc(ETH_ALEN, addr) >> 26;
+ return mask[n >> 5] & (1 << (n & 31));
+}
+
+static int update_filter(struct tap_filter *filter, void __user *arg)
+{
+ struct { u8 u[ETH_ALEN]; } *addr;
+ struct tun_filter uf;
+ int err, alen, n, nexact;
+
+ if (copy_from_user(&uf, arg, sizeof(uf)))
+ return -EFAULT;
+
+ if (!uf.count) {
+ /* Disabled */
+ filter->count = 0;
+ return 0;
+ }
+
+ alen = ETH_ALEN * uf.count;
+ addr = kmalloc(alen, GFP_KERNEL);
+ if (!addr)
+ return -ENOMEM;
+
+ if (copy_from_user(addr, arg + sizeof(uf), a...
2008 Jul 12
4
[PATCH] tun: Fix/rewrite packet filtering logic
...u32 *mask, const u8 *addr)
+{
+ int n = ether_crc(ETH_ALEN, addr) >> 26;
+ return mask[n >> 5] & (1 << (n & 31));
+}
+
+static int update_filter(struct tap_filter *filter, void __user *arg)
+{
+ struct { u8 u[ETH_ALEN]; } *addr;
+ struct tun_filter uf;
+ int err, alen, n, nexact;
+
+ if (copy_from_user(&uf, arg, sizeof(uf)))
+ return -EFAULT;
+
+ if (!uf.count) {
+ /* Disabled */
+ filter->count = 0;
+ return 0;
+ }
+
+ alen = ETH_ALEN * uf.count;
+ addr = kmalloc(alen, GFP_KERNEL);
+ if (!addr)
+ return -ENOMEM;
+
+ if (copy_from_user(addr, arg + sizeof(uf), a...
2023 Dec 11
1
Partial matching performance in data frame rownames using [
Dear all,
I have seen that others have discussed the partial matching behaviour of
data.frame[idx,] in the past, in particular with respect to unexpected
results sets.
I am aware of the fact that one can work around this using either
match() or switching to tibble/data.table or similar altogether.
I have a different issue with the partial matching, in particular its
performance when used on
2023 Dec 13
1
Partial matching performance in data frame rownames using [
...on takes a long time, it ought to be
> interruptible. Here's a patch that passes make check-devel:
>
> --- src/main/unique.c (revision 85667)
> +++ src/main/unique.c (working copy)
> @@ -1631,6 +1631,7 @@
> }
> }
>
> + unsigned int ic = 9999;
> if(nexact < n_input) {
> /* Second pass, partial matching */
> for (R_xlen_t i = 0; i < n_input; i++) {
> @@ -1642,6 +1643,10 @@
> mtch = 0;
> mtch_count = 0;
> for (int j = 0; j < n_target; j++) {
> + if (!--ic) {
> + R_CheckUserInterrupt();...
2008 Jul 30
1
model mix problem. FALSE CONVERGENCE
...SSE[1]]]
v2 <- Facteurs[[CLASSE[2]]]
if (is.null(v1) | is.null(v2)) {
guiDlgMessage("Vous n'avez pas sp?cifier un facteur cat?goriel
correct.\r\n\r\nAttention, il faut que le nom du facteur que vous entrez
\r\ndans l'interface et celui du fichier protocole soient \r\nexactement les
m?mes.\r\n\r\nR est sensible ? la case.",
title = "ERROR", type = "ok", icon = c("error"),
parent = 0)
}
## ANOVA 2 facteurs
Resultats=NULL
Res=NULL
i=0
while(i!=length(ions)) {...