similar to: getting last 2 charcters of a string, other "text" functions?

Displaying 20 results from an estimated 2000 matches similar to: "getting last 2 charcters of a string, other "text" functions?"

2009 Dec 23
7
String question
Hi to all I need a string like temp <- paste("m1","m2","m3",sep=",") But i must know how many items are in the string,afterwards the other option would be to use a vector temp <- c("m1","m2","m3") No problem to get the count of items but I must get afterwards the string "m1,m2,m3" No problem to build the
2010 Jan 25
0
valid charcters in trust password
Hello, we tried to create a trust between a samba 3.4.3 and win 2008. It did not work an we lost two days before we discovered that it did not work because we had a $ in the password. Is there documentation about what characters are valid in a password for a trust account ? Thanks Andreas
2003 Oct 17
1
sort charcters in W2K and NT
Hello. I have a problem using sort() in windows 2000 and windows NT 4.0, running R 1.8.0 on both. I want to sort a vector of characters names, where I have used "Scandinavian" letters, like '?', '?', and '?' (for those who cannot display these letters this question seems rather meaningless, i guess). Windows 2000 sorts the vector like I am used to from other
2015 Apr 24
2
Development version of R: Improved nchar(), nzchar() but changed API
Those of you who track R development closely, will have noticed yesterday's commit of enhanced versions of nchar() and nzchar(). ------------------------------------------------------------------------ r68254 | maechler | 2015-04-23 18:06:37 +0200 (Thu, 23 Apr 2015) | 1 line Changed paths: M doc/NEWS.Rd M src/library/base/R/New-Internal.R M src/library/base/R/zzz.R M
2003 Jan 30
1
not enough charcters available in %J or confusing blanks?
Hi, I try to create PDF files with an modified script from Buchan Milne and have some problems with the Jobname var %J. Because it is better for the users to find an file with an similar name as the original document I'm looking for a way to read out %J, cut some unnessasary stuff and use the rest as new file name. The problem is: In %J in some circumstances is not the complete Jobname as
2005 Dec 19
3
given a mid-month date, get the month-end date
I have a vector of dates. I wish to find the month end date for each. Any suggestions? e.g. For 12/15/05, I want 12/31/05, For 10/15/1995, I want 10/31/1995, etc __________________________________________________ [[alternative HTML version deleted]]
2016 Aug 04
1
findInterval(all.inside=TRUE) for degenerate 'vec' arguments
What should findInterval(x,vec,all.inside=TRUE) return when length(vec)<=1, so there are no inside intervals? R-3.3.0 gives a decreasing map of x->output when length(vec)==1 and -1's when length(vec)==0. Would '0' in all those cases be better? > findInterval(x=c(10, 11, 12), vec=11, all.inside=TRUE, rightmost.closed=FALSE, left.open=FALSE) [1] 1 0 0 >
2009 Jul 13
1
[PATCH] ocfs2: Add extra credits and access the modified bh in update_edge_lengths.
In normal tree rotation left process, we will never touch the tree branch above subtree_index and ocfs2_extend_rotate_transaction doesn't reserve the credits for them either. But when we want to delete the rightmost extent block, we have to update the rightmost records for all the rightmost branch(See ocfs2_update_edge_lengths), so we have to allocate extra credits for them. What's more,
2009 Jul 21
3
[PATCH 0/2] Two b-tree bug fixes.
Hi Mark/Joel, These are 2 bug fix for b-tree. Please review. I have sent out the first one last week, but it was based on cacheme. So resend it. Now it bases on joel's fixes branch. The second one is another b-tree rotation bug. I guess the reason why we never meet with it is that no one has ever used b-tree like reflink before. ;) Regards, Tao
2009 Jun 12
2
[PATCH 0/2] ocfs2: Adjust rightmost path in ocfs2_add_branch.v2
Hi Mark/Joel, This is the v2 of bug fix for ocfs2_add_branch. Modification from V1 to V2: 1. Create a patch which return EROFS instead of BUG in ocfs2_insert_at_leaf. 2. Use ocfs2_adjust_rightmost_records to change the root and extent blocks in the rightmost path. Regards, Tao
2010 May 06
3
Supressing axes 3 and 4 when using plot()
Is there a way of doing this? I'm using plot() to produce a scatter of my data, but it routinely defaults to plotting 2 sets of x axes and 2 y axes. I'd like to not plot the upper and rightmost axes. I can use 'axes=F', and then manually add axes with 'axis', but then the newly created axes do not intercept. TIA, Dan
2009 Jun 02
1
[PATCH] ocfs2: Adjust rightmost path in ocfs2_add_branch.
In ocfs2_add_branch, we use the rightmost rec of the leaf extent block to generate the e_cpos for the new added branch. In the most case, it is OK but if there is a gap between the the root(or branch) 's rightmost rec and the leaf, it will cause kernel panic if we insert some clusters in it. The message is something like: (7445,1):ocfs2_insert_at_leaf:3775 ERROR: bug expression:
2009 Feb 22
1
(no subject)
what the hell are you talking about? --- On Fri, 2/8/08, wine-users-request at winehq.org <wine-users-request at winehq.org> wrote: From: wine-users-request at winehq.org <wine-users-request at winehq.org> Subject: wine-users Digest, Vol 31, Issue 9 To: wine-users at winehq.org Date: Friday, February 8, 2008, 10:00 AM Send wine-users mailing list submissions to wine-users at
2007 Jun 26
3
[PATCH] Always use mipmaps in cube plugin
Currently, the cube plugin uses mipmapping only when cube is unfolded. When the cube is rotated, mipmaps are not used, which leads to ugly look of textures. The attached patch fixes this. This leads to another kind of artifacts, which are fixable with anisotropic filtering. http://team.pld-linux.org/~wolf/aniso.png The leftmost image is the current state of cube plugin. The center image is with
2009 Jun 12
2
Slicing an array
Hi all, I've been trying to work out how to slice an array of arbitrary dimension. I found a message showing how to stick two arrays together, but so far have been unable to transform that into what I need. Assume that I have a four dimensional array for example: array4d , , 1, 1 [,1] [,2] [1,] 3 6 [2,] 1 1 , , 2, 1 [,1] [,2] [1,] 4 7 [2,] 8 7 , , 1, 2
2015 Oct 05
9
Error generated by .Internal(nchar) disappears when debugging
On 05/10/2015 7:24 PM, Matt Dowle wrote: > Joris Meys <jorismeys <at> gmail.com> writes: > >> >> Hi all, >> >> I have a puzzling problem related to nchar. In R 3.2.1, the internal > nchar >> gained an extra argument (see >> https://stat.ethz.ch/pipermail/r-announce/2015/000586.html) >> >> I've been testing code using the
2008 Jan 29
2
[PATCH 0/2] Unwritten extent merge update, V2
The old extent merging code down underneath "ocfs2_mark_extent_written()" can't merge extents between leaf blocks. This patch resolve this. So that a large unwritten extent which has been split up with a bunch of writes can be merged together once all unwritten regions have been written to. Modification from V1 to V2: 1. Add more comments for some functions which is more complicated
2005 Oct 25
1
performance of nchar
Hi, Is nchar function knowingly slow in R? I'm doing some string formatting that requires multiple call to nchar, and nchar seems to be very slow. Experiment 1, pass nchar inside sprintf, and it takes 0.7 seconds > system.time(for (i in 1:10000) + str = sprintf('0005%020d', nchar(op)) + )[3] [1] 0.7 Experiment 2, get the length of op separately using nchar, and then pass
2006 Jan 10
5
matching country name tables from different sources
Hi, Before I reinvent the wheel I wanted to kindly ask you for your opinion if there is a simple way to do it. I want to merge a larger number of tables from different data sources in R and the matching criterium are country names. The tables are of different size and sometimes the country names do differ slightly. Has anyone done this or any recommendation on what commands I
2008 Sep 22
1
findInterval(), binary search, log(N) complexity
Dear R users, the help for findInterval(x,vec) suggests a logarithmic dependence on N (=length(vec)), which would imply a binary search type algorithm. However, when I "test" this hypothesis, in the following manner: set.seed(-3645); l <- vector(); N.seq <- c(5000, 500000, 1000000, 10000000, 50000000);k <- 1 for (N in N.seq){ tmp <- sort(round(stats::rt(N, df=2), 2));