search for: tail

Hello, All: The 'head' and 'tail' functions strip the time from a 'ts' object. Example: > head(presidents) [1] NA 87 82 75 63 50 > window(presidents, 1945, 1946.25) Qtr1 Qtr2 Qtr3 Qtr4 1945 NA 87 82 75 1946 63 50 Below please find code for 'head.ts' and 'tail.ts' that...

...that "[.ts" does NOT > return an object of class "ts". I see that "head.default" > and "head.matrix" both call "[", so "head" cannot return a > ts object, because "[" doesn't. Yes, the default head() and tail() are built on `[` very much on purpose. Note that `[` should *not* keep the "ts" property in general, e.g., lynx[c(1:3, 7)] cannot be a regular time series I think I'd consider using windows() for a head.ts() and tail.ts(), but in any case, I am sympathetic adding such m...

I suggest to add a new function to create a vector of n ``contiguous'' colors with tails in two colors. This function is similar to `cm.colors' but the colors can be choosen by hsv values. This function could be used e.g. as alternative to the default ``col.regions'' in `levelplot'. Perhaps the arguments in the following code could be simplified. Wolfram Fischer #...

...ts(head(as.zoo(presidents))) ## Qtr1 Qtr2 Qtr3 Qtr4 ## 1945 NA 87 82 75 ## 1946 63 50 xts also works here. On Sun, Jun 9, 2024 at 12:04?PM Spencer Graves <spencer.graves at prodsyse.com> wrote: > > Hello, All: > > > The 'head' and 'tail' functions strip the time from a 'ts' object. > Example: > > > > head(presidents) > [1] NA 87 82 75 63 50 > > > > window(presidents, 1945, 1946.25) > Qtr1 Qtr2 Qtr3 Qtr4 > 1945 NA 87 82 75 > 1946 63 50 > > > B...

...> ## 1945 NA 87 82 75 > ## 1946 63 50 > > xts also works here. > > On Sun, Jun 9, 2024 at 12:04?PM Spencer Graves > <spencer.graves at prodsyse.com> wrote: >> >> Hello, All: >> >> >> The 'head' and 'tail' functions strip the time from a 'ts' object. >> Example: >> >> >> > head(presidents) >> [1] NA 87 82 75 63 50 >> >> >> > window(presidents, 1945, 1946.25) >> Qtr1 Qtr2 Qtr3 Qtr4 >> 1945 NA 87 82 75 &gt...

...OT > > return an object of class "ts". I see that "head.default" > > and "head.matrix" both call "[", so "head" cannot return a > > ts object, because "[" doesn't. > > Yes, the default head() and tail() are built on `[` very much > on purpose. > Note that `[` should *not* keep the "ts" property in > general, e.g., > lynx[c(1:3, 7)] > cannot be a regular time series Agreed. > > I think I'd consider using windows() for a head.ts() and tail.ts(), &...

tail calls are only implemented for fastcall calling convention if i remeber right from my inquiries. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20091112/e8f1dd2a/attachment.html>

...es NOT > > return an object of class "ts". I see that "head.default" > > and "head.matrix" both call "[", so "head" cannot return a > > ts object, because "[" doesn't. > > Yes, the default head() and tail() are built on `[` very much > on purpose. > Note that `[` should *not* keep the "ts" property in > general, e.g., > lynx[c(1:3, 7)] > cannot be a regular time series > > I think I'd consider using windows() for a head.ts() and tail.ts(), > but...

>From IRC channel: <StenaviN> Can someone confirm cat/test-virt-tail.sh works in 'master'? <StenaviN> I get https://pastebin.com/GBkg7Vtw <rwmjones> StenaviN: yes it works for me; the error is not very helpful, you'll need to set LIBGUESTFS_DEBUG=1 LIBGUESTFS_TRACE=1 <StenaviN> https://pastebin.com/yABgCHwV <rwmjones> I think the...

On Sunday 22 February 2009 20:36:52 Duncan Sands wrote: > Hi Jon, > > > I have written a variety tests of tail calls for my HLVM and all passed > > with flying colors until I wrote this test (which is actually for > > algebraic datatypes) and discovered that it segfaults after ~100k > > iterations through what I think should be a tail call. Here's the IR: > > is this really a tai...

...gt;>> On Jun 27, 2016, at 12:25 PM, vivek pandya <vivekvpandya at gmail.com <mailto:vivekvpandya at gmail.com>> wrote: >>>>>> >>>>>> Hello , >>>>>> >>>>>> To solve this bug locally I have given preference to tail call optimization over local function related optimization in IPRA. I have added following method to achieve this: >>>>>> >>>>>> bool isEligibleForTailCallOptimization(Function *F) { >>>>>> CallingConv::ID CC = F->getCallingConv(); >&gt...

Hello Duncan and Jon, I am the criminal responsible for the tail call implementation in the backends. On Mon, Feb 23, 2009 at 9:17 AM, Duncan Sands <baldrick at free.fr> wrote: > Hi Jon, > >> >From what I have understood of the LLVM docs about when tail calls get >> eliminated on x86 and x64 it should be a tail call, yes. See below....

...option) any later version. > + * > + * This program is distributed in the hope that it will be useful, > + * but WITHOUT ANY WARRANTY; without even the implied warranty of > + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the > + * GNU General Public License for more details. > + * > + * (C) Copyright 2013-2014 Hewlett-Packard Development Company, L.P. > + * > + * Authors: Waiman Long <waiman.long at hp.com> > + * Peter Zijlstra <pzijlstr at redhat.com> > + */ > +#include <linux/smp.h> > +#include <linux/bug.h>...

...option) any later version. > + * > + * This program is distributed in the hope that it will be useful, > + * but WITHOUT ANY WARRANTY; without even the implied warranty of > + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the > + * GNU General Public License for more details. > + * > + * (C) Copyright 2013-2014 Hewlett-Packard Development Company, L.P. > + * > + * Authors: Waiman Long <waiman.long at hp.com> > + * Peter Zijlstra <pzijlstr at redhat.com> > + */ > +#include <linux/smp.h> > +#include <linux/bug.h>...

...amini at apple.com> wrote: >>>> >>>>> On Jun 27, 2016, at 12:25 PM, vivek pandya <vivekvpandya at gmail.com> wrote: >>>>> >>>>> Hello , >>>>> >>>>> To solve this bug locally I have given preference to tail call optimization over local function related optimization in IPRA. I have added following method to achieve this: >>>>> >>>>> bool isEligibleForTailCallOptimization(Function *F) { >>>>> CallingConv::ID CC = F->getCallingConv(); >>>>&gt...

I've run into some issues with tail calls in the past, make sure you are doing the following: 1. Call should be marked with tail (obviously) 2. Next statement after tail call should be 'return void' 3. Use fast call convention for tail calls 4. Make sure the function you are calling doesn't use the 'noreturn' att...

Hi Jon, > >From what I have understood of the LLVM docs about when tail calls get > eliminated on x86 and x64 it should be a tail call, yes. > > http://llvm.org/docs/CodeGenerator.html#tailcallopt > > . Caller and callee have the calling convention fastcc. > . The call is a tail call - in tail position (ret immediately follows call and > ret...

Since v2: - Fix the things that Pino mentioned, except the recursion. - Implement Windows support. For Windows support to be sane, I had to inline the add_and_mount code. Rich.

...articular order: > 1) Can we always annotate the call site rather than the function? > That removes the unpredictability due to optimization. > > > Annotating the call site should be fine. For the use cases that we > care about, it probably isn't important to prevent tail calls on > indirect calls. Given this, I would lean towards a notail value being added as an alternative to "tail" and "musttail". This seems to fit the existing uses, doesn't have any obvious loop holes or best effort semantics, and solves the problem at hand. >...

...I appreciate you for opening the process for input and comments. One > question stood out to me while reading the document: > > The document [1] indicates that only the 'ccc' calling convention will > be supported. The LLVM documentation [2] prominently notes that, > "tail calls can only be optimized when [fastcc], the GHC or the HiPE > convention is used." That note in the documentation seems to be incorrect, because LLVM will do tail call optimisations on at least x86 when using the "ccc" calling convention. For example: $ cat tail_call1.c voi...