similar to: support for radix order() over entire range of integers

Displaying 20 results from an estimated 20000 matches similar to: "support for radix order() over entire range of integers"

2017 Nov 06
1
[PATCH v17 2/6] radix tree test suite: add tests for xbitmap
On Fri, Nov 03, 2017 at 04:13:02PM +0800, Wei Wang wrote: > From: Matthew Wilcox <mawilcox at microsoft.com> > > Add the following tests for xbitmap: > 1) single bit test: single bit set/clear/find; > 2) bit range test: set/clear a range of bits and find a 0 or 1 bit in > the range. > > Signed-off-by: Wei Wang <wei.w.wang at intel.com> > Cc: Matthew Wilcox
2017 Nov 06
1
[PATCH v17 2/6] radix tree test suite: add tests for xbitmap
On Fri, Nov 03, 2017 at 04:13:02PM +0800, Wei Wang wrote: > From: Matthew Wilcox <mawilcox at microsoft.com> > > Add the following tests for xbitmap: > 1) single bit test: single bit set/clear/find; > 2) bit range test: set/clear a range of bits and find a 0 or 1 bit in > the range. > > Signed-off-by: Wei Wang <wei.w.wang at intel.com> > Cc: Matthew Wilcox
2016 Aug 25
1
sort.int(c(2, NA, 4), index.return=TRUE, na.last=NA, method)$ix differ for method="radix" and "shell"/"quick" (+ new default in R-devel)
Does sort.int(c(2,NA,4), index.return=TRUE, na.last=NA, method="radix")$ix give the intended result, because I get: > sort.int(c(2,NA,4), index.return=TRUE, na.last=NA, method="radix") $x [1] 2 4 $ix [1] 1 3 With method="shell" and method="quick" in R devel, I get: > sort.int(c(2,NA,4), index.return=TRUE, na.last=NA, method="shell") $x
2003 Apr 24
1
[Bug 547] Missing radix.o in makefile for AFS
http://bugzilla.mindrot.org/show_bug.cgi?id=547 Summary: Missing radix.o in makefile for AFS Product: Portable OpenSSH Version: 3.6p1 Platform: ix86 OS/Version: Linux Status: NEW Severity: minor Priority: P3 Component: Build system AssignedTo: openssh-unix-dev at mindrot.org ReportedBy:
2020 May 08
0
base::order making available retGrp and sortStr options for radix method?
Hi together, a bit more than a month ago I have released the 'collapse' package for advanced and fast data transformation in R with an array of fast grouped and weighted functions and facilities for efficient grouped programming in R. As I am preparing the next update of this package I have come across the following: For grouping, 'collapse' uses the function 'GRP', and
2008 Aug 21
1
x[order(x)] vs sort(x)?
Hi I have a question (which may be an obvious one). It is about an idiom which I have seen quite often: o <- order(x); <- x[o] vs. the alternative x <- sort(x) I am just wondering as to the rationale behind the order/reindex idiom vs sorting. Especially as there seems to be a marked performance difference (especially for integer vectors): > x <- trunc(runif(1E6, 1, 100)) >
2024 Apr 10
1
Problem with base::order
? Wed, 10 Apr 2024 09:33:19 +0200 Sigbert Klinke <sigbert at wiwi.hu-berlin.de> ?????: > decreasing=c(F,F,F) This is only documented to work with method = 'radix': >> For the ?"radix"? method, this can be a vector of length equal to >> the number of arguments in ?...? and the elements are recycled as >> necessary. For the other methods, it must be
2017 Nov 03
0
[PATCH v17 2/6] radix tree test suite: add tests for xbitmap
From: Matthew Wilcox <mawilcox at microsoft.com> Add the following tests for xbitmap: 1) single bit test: single bit set/clear/find; 2) bit range test: set/clear a range of bits and find a 0 or 1 bit in the range. Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Matthew Wilcox <mawilcox at microsoft.com> Cc: Andrew Morton <akpm at linux-foundation.org> Cc: Michael S.
2017 Sep 14
1
Bug in order function
Dear R-devel(opers), I wanted to draw your attention to a small problem with the order function in base. According to the documentation, radix sort supports different orders for each argument. This breaks when one of the arguments is an object. Please have a look to this stackoverflow question:
2024 Apr 10
1
Problem with base::order
Hi, when I execute order(letters, LETTERS, 1:26) then everything is fine. But if I execute order(letters, LETTERS, 1:26, na.last=c(T,T,T), decreasing=c(F,F,F)) I get the error message Error in method != "radix" && !is.na(na.last) : 'length = 3' in constraint to 'logical(1)' Shouldn't both give the same result? Sigbert
2012 Jan 28
3
[LLVMdev] [Sparc] size of input arguments with doubles in llvm byte code?
Hi, I have a llvm asssembly version of radix_mod.c modified from radix (a splash2 bench mark). It is named radix.bc. I have extended the number of arguments from 2 to 4 in the function called product_mod_46 and saved it as a new file called radix_mod.bc . Although the extra arguments does not do anything in the function. It still broke the code on sparc. However, both versions of the byte code
2012 Jan 28
0
[LLVMdev] [Sparc] size of input arguments with doubles in llvm byte code?
ckathy wrote: > > Hi, > > I have a llvm asssembly version of radix_mod.c modified from radix (a > splash2 bench mark). It is named radix.bc. > > I have extended the number of arguments from 2 to 4 in the function called > product_mod_46 and saved it as a new file called radix_mod.bc . Although > the extra arguments does not do anything in the function. It still broke
2004 Mar 04
2
Compiling under kernel 2.6.0 and after
Hi, I'm trying to compile Samba 3.0.2a under Linux 2.6.3 (same problem on all 2.6.x kernels) and get the following error chucked out. Only occurs with --with-smbmount as you might expect from the file it fails on. Anyone else had this problem and fixed it? Regards Dan In file included from /usr/include/linux/fs.h:20, from /usr/include/linux/smb_fs.h:15,
2009 Feb 06
0
[PATCH 5/9] tmem: add modified radix-tree files from Linux
[5] add radix-tree files from Linux with a few changes (documented at begin of file) _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel
2017 Sep 11
1
[PATCH v15 1/5] lib/xbitmap: Introduce xbitmap
On Mon, Aug 28, 2017 at 06:08:29PM +0800, Wei Wang wrote: > From: Matthew Wilcox <mawilcox at microsoft.com> > > The eXtensible Bitmap is a sparse bitmap representation which is > efficient for set bits which tend to cluster. It supports up to > 'unsigned long' worth of bits, and this commit adds the bare bones -- > xb_set_bit(), xb_clear_bit() and xb_test_bit().
2017 Sep 11
1
[PATCH v15 1/5] lib/xbitmap: Introduce xbitmap
On Mon, Aug 28, 2017 at 06:08:29PM +0800, Wei Wang wrote: > From: Matthew Wilcox <mawilcox at microsoft.com> > > The eXtensible Bitmap is a sparse bitmap representation which is > efficient for set bits which tend to cluster. It supports up to > 'unsigned long' worth of bits, and this commit adds the bare bones -- > xb_set_bit(), xb_clear_bit() and xb_test_bit().
2017 Nov 30
2
[PATCH v18 01/10] idr: add #include <linux/bug.h>
On Wed, Nov 29, 2017 at 09:55:17PM +0800, Wei Wang wrote: > The <linux/bug.h> was removed from radix-tree.h by the following commit: > f5bba9d11a256ad2a1c2f8e7fc6aabe6416b7890. > > Since that commit, tools/testing/radix-tree/ couldn't pass compilation > due to: tools/testing/radix-tree/idr.c:17: undefined reference to > WARN_ON_ONCE. This patch adds the bug.h header to
2017 Nov 30
2
[PATCH v18 01/10] idr: add #include <linux/bug.h>
On Wed, Nov 29, 2017 at 09:55:17PM +0800, Wei Wang wrote: > The <linux/bug.h> was removed from radix-tree.h by the following commit: > f5bba9d11a256ad2a1c2f8e7fc6aabe6416b7890. > > Since that commit, tools/testing/radix-tree/ couldn't pass compilation > due to: tools/testing/radix-tree/idr.c:17: undefined reference to > WARN_ON_ONCE. This patch adds the bug.h header to
2014 Dec 18
1
[ARM][FFT][NEON] Integrate Ne10 into Opus?
Hi Ralph, I have pushed patches to enable radix 3 and radix 5. Github: https://github.com/projectNe10/Ne10/releases/tag/v1.2.0 Best Regards, Phil Wang > Date: Thu, 11 Dec 2014 10:46:50 -0800 > From: Ralph Giles <giles at thaumas.net> > Subject: Re: [opus] [ARM][FFT][NEON] Integrate Ne10 into Opus? > To: opus at xiph.org > Message-ID: <5489E69A.5000305 at thaumas.net>
2009 Aug 20
2
[LLVMdev] error api for APInt / APFloat
I'm breaking this out from LLVM asserts thread. Here are all the assertions in APInt I consider should be recoverable: APInt::APInt: bitwidth too small Null pointer detected! APInt::getBitsNeeded: Invalid string length string is only a minus! Invalid radix APInt::fromString: Radix should be 2, 8, 10, or 16! Invalid string length string is only a minus Insufficient bit width Invalid digit in