search for: ungain

Displaying 8 results from an estimated 8 matches for "ungain".

Did you mean: angain
2004 Oct 07
8
Equivalents of Matlab's 'find' and 'end'
...he X is the same as in the previous example. This cutsie little command was extremely useful for composing programs that were flexible and could use input matrices of any size without modifying the code. I realize that you can accomplish the same by Y <- X[2:length(X)] in R, but this method is ungainly, particularly when subsetting matrices rather than vectors. If anyone has advice, I'd be grateful, Bryan L. Brown Integrative Biology University of Texas at Austin Austin, TX 78712 512-965-0678 stonefly@mail.utexas.edu [[alternative HTML version deleted]]
2006 Mar 02
0
Combining plaintext and plotmath expressions
...ega)' > testlabel<-'E-test' > op<-'dev lab' > oplabel<-'Development Lab' > expr.label("SPC Chart for") I then use exprtitle in: plot(1:10,title= if(plotnum==1) parse(text=exprtitle) else NULL) However: this code seems convoluted and ungainly I don't always get the results I want Any suggestions? Leif Kirschenbaum Senior Yield Engineer Reflectivity, Inc. (408) 737-8100 x307 leif at reflectivity.com
2002 May 15
0
language: bug or feature: vector-subscript of list (PR#1558)
...e relaxed: test> listio_ list( a=list( b=9, c='hello'), d=1:5) test> listio[[ c(1,2)]] [1] "hello" test> The same goes for assignment into recursive lists. I find this feature essential, so I eventually wrote the workarounds below. But I'm sure these are slow and ungainly. Could this feature not be added as a primitive? cheers Mark assign( '[[', function( var, ...) { pg_ .Primitive( '[[') vv_ as.name( 'var') for( i in c(...)) vv_ call( 'pg', vv, i) eval( vv) }) assign( '[[<-', function( var, ..., value) {...
2002 May 15
0
(PR#1558) language: bug or feature: vector-subscript of
...=list( b=9, c='hello'), d=1:5) > test> listio[[ c(1,2)]] > [1] "hello" > test> > > The same goes for assignment into recursive lists. > > I find this feature essential, so I eventually wrote the workarounds below. But > I'm sure these are slow and ungainly. > > Could this feature not be added as a primitive? [[ is already a primitive, and nowhere that I can see is it documented that it allows an argument of length 2. So it is neither a bug nor a feature, but a difference from S. If you submit a patch based on the current R-devel sources, w...
2006 Nov 01
3
User quotas. A recurring question
One question that keeps coming up in my discussions about ZFS is the lack of user quotas. Typically this comes from people who have many tens of thousands (30,000 - 100,000) of users where they feel that having a file system per user will not be manageable. I would agree that today that is the case however I personally don''t see this as an insurmountable problem. However the questions
2019 May 14
4
where to find wifi driver
On 14/05/2019 13:09, Jonathan Billings wrote: > On Tue, May 14, 2019 at 10:13:35AM +0800, qw wrote: >> I use the wifi adaptor, Edimax AC1200, and its driver can be >> downloaded from >> >> 'http://www.edimax.com.tw/edimax/download/download/data/edimax/tw/download/for_home/wireless_adapters/wireless_adapters_ac1200_dual-band/ew-7822ulc'. >> >> >>
2012 Jun 14
4
RAID options for Gluster
I think this discussion probably came up here already but I couldn't find much on the archives. Would you able to comment or correct whatever might look wrong. What options people think is more adequate to use with Gluster in terms of RAID underneath and a good balance between cost, usable space and performance. I have thought about two main options with its Pros and Cons No RAID (individual
2014 Oct 13
9
[LLVMdev] [RFC] Less memory and greater maintainability for debug info IR
In r219010, I merged integer and string fields into a single header field. By reducing the number of metadata operands used in debug info, this saved 2.2GB on an `llvm-lto` bootstrap. I've done some profiling of DW_TAGs to see what parts of PR17891 and PR17892 to tackle next, and I've concluded that they will be insufficient. Instead, I'd like to implement a more aggressive plan,