search for: reimplementing

Hello, My name is Sean Mikalson. I am a second year Software Engineering student with a combined degree in Philosophy. I am interested in participating with Xapian in GSOC this year and a couple of projects have initially caught my eye: - Dynamic Snippets - QueryParser Reimplementation I have good working knowledge in C/C++, Java and SQL (specifically Transact-SQL). In order to determine

Hi, For some maybe dumb reasons I try to write a portable version of int128. What is very valuable for this implementation is access to MUL instruction on x86 which provides full 64 x 64 -> 128 bit multiplication. An equally useful on ARM would be UMULH instruction. Well, the way you can access this on clang / GCC is to use __int128 type or use inline assembly. MSVC provides an intrinsic for

Hello, I have a script in R language that makes sorting using the order() method of R language. What I need is to reimplement this method in any other language (PHP, Perl, Python, Java maybe). First I tried to reimplement it in php, here is some numbers that i need to sort: 1,2,3,4,5,6,7,8,9,10,300,231,11,12,0,1 R language: n = c(1,2,3,4,5,6,7,8,9,10,300,231,11,12,0,1) n [1] 1 2 3 4 5

On Wednesday, 21 June 2017 19:29:07 CEST Richard W.M. Jones wrote: > v7 was: > https://www.redhat.com/archives/libguestfs/2017-June/msg00169.html > https://www.redhat.com/archives/libguestfs/2017-June/msg00184.html > > I believe this addresses all comments received so far. Patches #1-13 LGTM (just with a small fixup needed in patch #7). > Also it now passes a test where I

On Wed, Jul 19, 2017 at 03:14:48PM +0200, Pino Toscano wrote: > > + > > + let statbuf = Chroot.f chroot lstat path in > > Hm is chroot needed for this? The current C implementation does not > use CHROOT_IN/OUT, and it does not even resolve symlinks, so it should > be safe. The implementation is different, but I think it's equivalent and safe. The ‘Chroot’ module

On Friday, 21 July 2017 22:36:04 CEST Richard W.M. Jones wrote: > v1 -> v2: > > - [lots of changes] Thanks for them. > Requested, but not done for various reasons: > > - Removing GUESTFSD_EXT_CMD. This is still being used by OpenSUSE, so > we'll have to think of a better mechanism for it. Something like > ‘guestfsd --dump-commands’ may work better. Note I

On Monday, 31 July 2017 17:40:49 CEST Richard W.M. Jones wrote: > v10: https://www.redhat.com/archives/libguestfs/2017-July/msg00245.html > > No actual change here, but I rebased and retested. Also this series > now does not depend on any other patch series since everything else > needed is upstream. a) I just sent few easy notes, but I did not check most of the rest yet b) in

Richard, 1.38 is out. Can we come back and discuss these patch series? -- Mykola Ivanets 2018-02-06 10:31 GMT+02:00 Richard W.M. Jones <rjones@redhat.com>: > On Sun, Jan 28, 2018 at 11:54:19PM +0200, Mykola Ivanets wrote: >> Instead of parsing 'parted' output OCaml implementation relies on the following facts: >> >> 1. The function is applicable for MBR

On Mon, Feb 19, 2018 at 09:48:39PM +0200, Nikolay Ivanets wrote: > Richard, 1.38 is out. Can we come back and discuss these patch series? Can you repost it, rebased, and taking into account the review comments from last time. Thanks, Rich. -- Richard Jones, Virtualization Group, Red Hat http://people.redhat.com/~rjones Read my programming and virtualization blog: http://rwmj.wordpress.com

Hi All, I've gotten a number of reports from users about gplots::heatmap.2 generating 'node stack overflow' errors. As it turns out, these errors originate in stats:::plotNode, and are triggered when it is passed a dendrogram that is too deeply nested. While increasing the stack size (which is a compile-time option for byte coded functions) can allow a particular instance to

hello everyone, I am Maheshwar, a prefinal year Computer Science undergraduate student at BITS-Pilani, India. When i was going through the GSOC ideas , i felt interested in Quesry parser project. Till now i have implemented a couple of LL(1) parsers as a part of my assignment in Compiler construction course, so i would love to join and contribute to this project. So can any one tell me how to go

On trunk we never generate MULX. We used to blindly use it anytime bmi2 was enabled, but its a longer encoding and isn't a guaranteed register allocation improvement. So I took it out a few weeks ago. We need a more precise heuristic for when to use it. LLVM trunk will never generate ADCX/ADOX either. This was removed in September. We used to inconsistently generate them when adx was enabled

On Friday, 14 July 2017 15:39:27 CEST Richard W.M. Jones wrote: > +let rec list_filesystems () = > + let has_lvm2 = Lvm.available () in > + let has_ldm = Ldm.available () in > + > + let devices = Devsparts.list_devices () in > + let partitions = Devsparts.list_partitions () in > + let mds = Md.list_md_devices () in > + > + (* Look to see if any devices directly

On Sun, Jan 28, 2018 at 11:54:19PM +0200, Mykola Ivanets wrote: > Instead of parsing 'parted' output OCaml implementation relies on the following facts: > > 1. The function is applicable for MBR partitions only (as noted in documentation and as function name suggests). This might be how it's documented, but the implementation has a nod towards gpt: > - for (i = 0, row =

On Friday, 14 July 2017 15:39:11 CEST Richard W.M. Jones wrote: > diff --git a/daemon/file.c b/daemon/file.c > index 84874dc6f..ee79eb507 100644 > --- a/daemon/file.c > +++ b/daemon/file.c > @@ -30,7 +30,6 @@ > #include "actions.h" > #include "optgroups.h" > > -GUESTFSD_EXT_CMD(str_file, file); When migrating to OCaml, these extra sections in the

Simplify how we handle lvm.conf.

Hi all, I committed win32-driveinfo 0.1.0 to CVS. What is it? =========== A class for getting information of drives Synopsis ======== include Win32::DriveInfo (sectorsPerCluster, bytesPerSector, numberOfFreeClusters, totalNumberOfClusters, freeBytesAvailableToCaller, totalNumberOfBytes, totalNumberOfFreeBytes) = getDriveSpace(''c'').to_a

--- daemon/parted.c | 56 ----------------------------------------------- daemon/parted.ml | 51 ++++++++++++++++++++++++++++++++++++++++++ daemon/parted.mli | 8 +++++++ generator/actions_core.ml | 1 + 4 files changed, 60 insertions(+), 56 deletions(-) diff --git a/daemon/parted.c b/daemon/parted.c index a1e5c81cf..125aec60b 100644 --- a/daemon/parted.c +++

I have prices that I am finding difficult to compare with ==, > and >, due to precision. For example: the numbers should match, with '==', but they differ in the magnitude of 1e-14 due to bunch of calculations that I run on them. Programming with java, I am used to implementing a function that compares the difference between the numbers to a pre determined precision factor. This

The Wine development release 5.4 is now available. What's new in this release (see below for details): - Unicode data updated to Unicode version 13. - Builtin programs use the new UCRTBase C runtime. - More correct support for Internationalized Domain Names. - Support for painting rounded rectangles in Direct2D. - Text drawing in D3DX9. - Various bug fixes. The source is