similar to: Force the for loop to stop

Hi, I am trying to install the “impute” package in unix. but I get the following error message. I followed the following steps. Do you know what is causing this and how I can solve this problem? source("http://www.bioconductor.org/biocLite.R") biocLite("impute") Using R version 2.11.1, biocinstall version 2.6.10. Installing Bioconductor version 2.6 packages: [1]

Hi, I am trying to use tune.svm in e1071 package. the command i use is tobj <- tune.svm(labels, data= data, cost = 10^(1:2)) Should the last column of the 'data' contain the labels as well? I want to use the linear kernel. But it gives me the error "Error in model.frame.default(formula, data) : 'data' must be a data.frame, not a matrix or an array" Do you know why

Hi All, What is the fastest way of finding if any members of vector x fall in the range of the rows of matrix y? I do not want to use two for loops as this will take forever. Any help will be appreciated, best, salih [[alternative HTML version deleted]]

Hi, Is there a quick way of finding if numbers in a vector falls in between a range defined in another matrix. As an example let x y 0 1 3 2 6 9 25 15 18 I want to check one by one whether 0,2 and 25 falls in any of the ranges in y. I am using 2 for loops but it is taking a huge amount of time. is there any other alternative way to do this? best, salih [[alternative HTML

Hello, I want to insert a control-block before every outermost loop. My current solution is: 1) find each outermost loop in some function; 2) find the loop header with Loop->getHeader() APIs, and then insert the controller block before the header block of current loop. But I encounters problems when there multi subsequent loops in the following example, where there is no code between loops:

Easy question that I can't find an answer for. I'm trying to subset a data frame and want to exclude the positive values, i.e. I want the NA values. My data: > summary(temp$tuna) Min. 1st Qu. Median Mean 3rd Qu. Max. NA's 1 2 3 3 4 5 1211 Querying for subset(temp, tuna %in% "NA", select.... subset(temp, tuna == NA,

Hello, Since some months I can not get any feedback from you for my questions in two different account with the same name. I just wonder is there any specific reason for it? Maybe my english is not so clear or I ask wrong questions for wrong lists I don't know but in any case I think I should have been informed. Sincerely Yours Murat Can Tuna

i want to tag categories to its menuname. i have a csv containing menu item name and in other csv i have a column containing some strings, i want to pick that strings from categories and look into menu items if any menu item containing that string i want to create a new column next to menu item name flagged as 1 otherwise 0 and the only condition is once a menu item flagged as 1 i don't need

Hi weiren, Thanks for your suggestion! Yes, I am trying to do this "nested flattening". It seems that I need a post-dominator tree-based algorithm to flatten the nested loops from the innermost to the outermost, level by level. Is there any feature already existed in LLVM tools? Or similar? On Sun, Oct 22, 2017 at 2:31 AM, 陳韋任 <chenwj.cs97g at g2.nctu.edu.tw> wrote: > If

Hi, In the course of my experiments with rt kernels it so happens that the gui versions of tuna built from upstream (RHEL, F11) SRPMs show wrong affinity settings for IRQ threads. Where would be a proper place to report this and get some help on other rt-related issues? Thanks, Sasha

Hello, I have a problem about reaching my share folder when the permission is 750 but whenever I change it to 755 I can see the content of the folder. for 750 I get this result: "smbclient //serverip/sharename -U username" smb: \> ls NT_STATUS_NETWORK_ACCESS_DENIED listing \* 0 blocks of size 0. 9 blocks available smb: \> but for 755 everything is fine but of

Hi everyone, I hope to implement a feature to transform an IR with "while" or "for" loops to a new IR with no loop. Instead, I just want to use if-else statements in the new IR to implement the original semantics. I can easily write a transform pass to handle the 1-level loop case, but for nested loops it seems a little harder. Can you show me some hints? Thank you very

It appears that "break" will break from the outermost enclosing loop not the innermost loop. Is it a bug or language feature? Tim -- Timothy H. Keitt National Center for Ecological Analysis and Synthesis 735 State Street, Suite 300, Santa Barbara, CA 93101 Phone: 805-892-2519, FAX: 805-892-2510 http://www.nceas.ucsb.edu/~keitt/

Hi, I'm having problems with the LoopIdiomRegognizer crashing on me with An asserting value handle still pointed to this value! UNREACHABLE executed at ../lib/IR/Value.cpp:695! If I remove AU.addPreserved<LoopInfoWrapperPass>(); or AU.addPreserved<AAResultsWrapperPass>(); everything goes well. The C-code triggering this is void foo(int a[10][10]) { int i, j,

We generate xEXT nodes in many cases. Unlike GCC which vectorizes inner loops, we vectorize the implicit outermost loop of data-parallel workloads (also called whole function vectorization). We vectorize code even if the user uses xEXT instructions, uses mixed types, etc. We choose a vectorization factor which is likely to generate more legal vector types, but if the user mixes types then we

Hi, I would like to know if it is possible to extract the source level names of variables that create loop-carried dependencies. For example, for the following code: for (int i = 0; i < A_ROW; i++) { for (int j = 1; j < B_COL; j++) { a_matrix[i][j] = a_matrix[i][j - 1]; } } I get the following AST: #pragma omp parallel for

On Tue, 7 Nov 2006, Vikram Adve wrote: >> I think I see the issue here. The point of the pass manager (in >> general) >> is for passes to *give up control* over iteration order in order for >> obtain something else. > > > Right, I understand that. I think that works fine in most cases. > For loop passes, though, this approach is causing some of the >

On Mar 11, 2013, at 4:23 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > On Mon, Mar 11, 2013 at 3:45 PM, Manman Ren <mren at apple.com> wrote: >> >> On Mar 11, 2013, at 2:37 PM, Daniel Berlin <dberlin at dberlin.org> wrote: >> >>> On Mon, Mar 11, 2013 at 2:06 PM, Manman Ren <mren at apple.com> wrote: >>>> >>>>

On Mar 11, 2013, at 7:52 PM, Daniel Berlin wrote: > On Mon, Mar 11, 2013 at 4:56 PM, Manman Ren <mren at apple.com> wrote: >> >> On Mar 11, 2013, at 4:23 PM, Daniel Berlin <dberlin at dberlin.org> wrote: >> >>> On Mon, Mar 11, 2013 at 3:45 PM, Manman Ren <mren at apple.com> wrote: >>>> >>>> On Mar 11, 2013, at 2:37 PM,

"Rotem, Nadav" <nadav.rotem at intel.com> writes: > We generate xEXT nodes in many cases. Unlike GCC which vectorizes > inner loops, we vectorize the implicit outermost loop of data-parallel > workloads (also called whole function vectorization). We vectorize > code even if the user uses xEXT instructions, uses mixed types, etc. > We choose a vectorization factor