search for: walk

...g: /usr/local/puppet-0.24.8-2/lib/ruby/site_ruby/1.8/puppet/ simple_graph.rb:28:in `adjacent'' debug: /usr/local/puppet-0.24.8-2/lib/ruby/site_ruby/1.8/puppet/ simple_graph.rb:232:in `adjacent'' debug: /usr/local/puppet-0.24.8-2/lib/ruby/site_ruby/1.8/puppet/ simple_graph.rb:260:in `walk'' debug: /usr/local/puppet-0.24.8-2/lib/ruby/site_ruby/1.8/puppet/ simple_graph.rb:262:in `walk'' debug: /usr/local/puppet-0.24.8-2/lib/ruby/site_ruby/1.8/puppet/ simple_graph.rb:260:in `each'' debug: /usr/local/puppet-0.24.8-2/lib/ruby/site_ruby/1.8/puppet/ simple_graph.rb:...

...se predictors whom i removed just on the basis of multicollinearity ? I'll appreciate if someone can throw some light on this matter and how to use R to detect the interactions effectively . Thanks Regards Dev ------Final 'lm model'-------------------- > logmodelfull_minus_run_hr_walk_batting <- lm(log(salary) ~ hit+rbi + walk + obp + strike.out+free.agent.eligible+free.agent.1991+arbitr.elgible.) > summary(logmodelfull_minus_run_hr_walk_batting) Call: lm(formula = log(salary) ~ hit + rbi + walk + obp + strike.out + free.agent.eligible + free.agent.1991 + arbitr.elgib...

...->player, "audio-removed", audio); audio->added = FALSE; @@ -197,7 +201,7 @@ swfdec_player_render_audio (SwfdecPlayer *player, gint16* dest, g_return_if_fail (n_samples > 0); SWFDEC_LOG ("rendering offset %u, samples %u", start_offset, n_samples); - for (walk = player->audio; walk; walk = walk->next) { + for (walk = player->priv->audio; walk; walk = walk->next) { audio = walk->data; swfdec_audio_render (audio, dest, start_offset, n_samples); } diff --git a/libswfdec/swfdec_audio_event.c b/libswfdec/swfdec_audio_event.c in...

...whom i removed just on the basis of multicollinearity ? I'll appreciate if someone can throw some light on this matter and how to use R to detect the interactions effectively . Thanks Regards Dev > ------Final 'lm model'-------------------- > > logmodelfull_minus_run_hr_walk_batting <- lm(log(salary) ~ hit+rbi + walk > + obp + strike.out+free.agent.eligible+free.agent.1991+arbitr.elgible.) > > summary(logmodelfull_minus_run_hr_walk_batting) > > Call: > lm(formula = log(salary) ~ hit + rbi + walk + obp + strike.out + > free.agent.eligible + f...

hi all how does one simulate a random walk process? i.e y(0)=0 y(t)=y(t-1)+ e(t) where e(t) is normal(0,1) say. Regards allan

...ovie, guint goto_frame) { @@ -377,9 +393,22 @@ swfdec_sprite_movie_goto (SwfdecSpriteMo SWFDEC_DEBUG ("performing goto %u -> %u for character %u", movie->frame, goto_frame, SWFDEC_CHARACTER (movie->sprite)->id); if (goto_frame < movie->frame) { + GList *walk; movie->frame = 0; - old = mov->list; - mov->list = NULL; + for (walk = mov->list; walk && + swfdec_depth_classify (SWFDEC_MOVIE (walk->data)->depth) != SWFDEC_DEPTH_CLASS_TIMELINE; + walk = walk->next) { + /* do nothing */ + } + old = walk; +...

I've wrote some code to simulate a random walk in 2 dimensions on a lattice. Basically I want to add something in to make it plot it point by point so you can see what is going on. Heres my code for the random walk in 2d RW2D<-function(N) { i<-0 xdir<-0 ydir<-0 xpos<-vector() xpos[1]<-xdir ypos<-...

...ata(zelazo) from library(ISwR): > library(ISwR) > data(zelazo) > attach(zelazo) > zelazo $active [1] 9.00 9.50 9.75 10.00 13.00 9.50 $passive [1] 11.00 10.00 10.00 11.75 10.50 15.00 $none [1] 11.50 12.00 9.00 11.50 13.25 13.00 $ctr.8w [1] 13.25 11.50 12.00 13.50 11.50 > walk <- stack(list("active"=active, "passive"=passive, "none"=none, "ctr.8w"=ctr.8w)) > walk values ind 1 9.00 active [...rows deleted...] 23 11.50 ctr.8w I want to name the first column "walking" and the second column "train...

hello R-masters. i have an R-issue here that i don't know if you'd wish to help me? about it: briefly i'd like to generate many (say hundred) realizations of a random walk, execute a few operations on each of them (mean time of return), and graph each realization on the same plot. IN OTHER WORDS I'D LIKE TO IMPOSE A LOOPING CYCLE TO THE COMMAND NOT THE ARGUMENT OF THE COMMAND. for some of these questions i have already a partial answer: my main problem here is a...

...be added will be making # this value more than 500, you can imagine that there could be a large spike in data and this would be affecting points near # if this precaution haven't been conceived foreach ($rang as $k=>&$v) { if (!($k % 100)) echo $k.' '; $up = $down = array(); $walk = 0; while (true) { ++$walk; if (isset($sum[$k-$walk]) and count($v)+count($up)+count($sum[$k-$walk])<500) $up = array_merge($up,$sum[$k-$walk]); else break; } $walk = 0; while (true) { ++$walk; if (isset($sum[$k+$walk]) and count($v)+count($down)+count($sum[$k+$walk])<500)...

Hi all, Can anyone please tell me how to calculate the expected distance covered in a 2d random walk. Please! -- View this message in context: http://r.789695.n4.nabble.com/2d-rndom-walk-tp3632468p3632468.html Sent from the R help mailing list archive at Nabble.com.

...test is simply the probability that a random assignment of the pooled data to two sets of the sizes of the input data sets has a KS test statistic at least as great as that of the input data. The function psmirnov2x in ks.c calculates this probability by enumerating all such assignments as lattice walks, except that it doesn't know how to handle tied data points. The correct procedure can be deduced by considering that steps in such lattice walks represent steps along the x-axis in computing the empirical CDFs of the two data sets. The trick is to consider all occurrences of a repeated data...

> On Mar 25, 2020, at 12:52 AM, Doerfert, Johannes <jdoerfert at anl.gov> wrote: > > > Some random thoughts: > > If no pass ever walks the use list of a constant, except globals which > we could handle differently, we could get rid of their use-list or > overwrite their use-list interface functions to make them no-ops. This would be really problematic because it breaks orthogonality in the compiler. Today, you can walk t...

Hi all, Is there a way to walk through ALL the predecessors of a basic block in a CFG. I tried to iterate over the preds using this method for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++I) { BasicBlock *PredBB = *PI; } but this only gives the immediate predecessors for a basic block. For example, in t...

...,40 @@ swfdec_movie_mark (SwfdecAsObject *objec } /* FIXME: This function can definitely be implemented easier */ -static SwfdecMovie * -swfdec_movie_get_by_name (SwfdecPlayer *player, const char *name) +SwfdecMovie * +swfdec_movie_get_by_name (SwfdecMovie *movie, const char *name) { GList *walk; - int i = SWFDEC_AS_CONTEXT (player)->version; + int i; gulong l; + guint version = SWFDEC_AS_OBJECT (movie)->context->version; char *end; + SwfdecPlayer *player = SWFDEC_PLAYER (SWFDEC_AS_OBJECT (movie)->context); - if ((i >= 7 && !g_str_has_prefix (name, &quot...

...the original name, too diff --git a/libswfdec/swfdec_movie.c b/libswfdec/swfdec_movie.c index 420c508..6a03bd1 100644 --- a/libswfdec/swfdec_movie.c +++ b/libswfdec/swfdec_movie.c @@ -794,6 +794,7 @@ swfdec_movie_mark (SwfdecAsObject *objec SwfdecMovie *movie = SWFDEC_MOVIE (object); GList *walk; + swfdec_as_string_mark (movie->original_name); swfdec_as_string_mark (movie->name); for (walk = movie->list; walk; walk = walk->next) { swfdec_as_object_mark (walk->data); diff-tree 268e7076b34235aac77568686c29cc49c127171e (from 27da7a35529646e527d6430f7372f2535c66d62...

On Mar 25, 2020, at 4:14 PM, Doerfert, Johannes <jdoerfert at anl.gov> wrote: > >> Today, you can walk the use-list of any operand to an instruction. >> This would be broken by this change, > > First, you would be able to walk the use-list of any operand. So nothing > breaks just yet. If I understand correctly, you are suggesting that you can walk it, but you don’t get all the uses....

...gt;> On 3/2/23 03:38, Liam R. Howlett wrote: >>> * Danilo Krummrich <dakr at redhat.com> [230227 08:17]: >>> >>> ... >>>>>> Would this variant be significantly more efficient? >>>>> >>>>> Well, what you are doing is walking the tree to see if there's anything >>>>> there... then re-walking the tree to store it. So, yes, it's much more >>>>> efficient.. However, writing is heavier. How much of the time is spent >>>>> walking vs writing depends on the size of th...

...clude "swfdec_player_internal.h" #include "js/jsdbgapi.h" @@ -536,3 +537,42 @@ swfdec_debugger_get_stepping (SwfdecDebu return debugger->stepping; } +const char * +swfdec_debugger_run (SwfdecDebugger *debugger, const char *command) +{ + SwfdecPlayer *player; + GList *walk; + jsval rval; + const char *ret; + + g_return_val_if_fail (SWFDEC_IS_DEBUGGER (debugger), NULL); + g_return_val_if_fail (command != NULL, NULL); + + player = SWFDEC_PLAYER (debugger); + g_object_freeze_notify (G_OBJECT (debugger)); + + + if (swfdec_js_run (player, command, &rval)) { +...

...nd->streams = g_list_remove (stream->sound->streams, stream); + g_object_unref (stream->audio); + g_free (stream); +} + +/*** SOUND ***/ + +static void +advance_before (SwfdecPlayer *player, guint msecs, guint audio_samples, gpointer data) +{ + SwfdecPlayback *sound = data; + GList *walk; + + for (walk = sound->streams; walk; walk = walk->next) { + Stream *stream = walk->data; + if (audio_samples >= stream->offset) { + stream->offset = 0; + } else { + stream->offset -= audio_samples; + } + } +} + +static void +audio_added (SwfdecPlayer *...