comparison src/paranormal/containers.c @ 164:0393aae79318 trunk

[svn] - clean up about box - add on-beat branch-change evaluation

163:46e074b915eb

#include <stdio.h>

#include <glib.h>

#include "actuators.h"

/* **************** all containers **************** */

/* Add a actuator to a container (end of list) */
void

/* **************** container_cycle ***************** */
static struct pn_actuator_option_desc container_cycle_opts[] =
{
  { "change_interval", "The number of seconds between changing the "
    "child to be executed", OPT_TYPE_INT, { ival: 20 } },
  { "random", "Whether or not the change should be random",
    OPT_TYPE_BOOLEAN, { bval: TRUE } },
  { 0 }
};

struct container_cycle_data
{
  GSList *children;
  GSList *current;
  int last_change;
};

static void
container_cycle_init (gpointer *data)
{

container_cycle_exec (const struct pn_actuator_option *opts,
		      gpointer data)
{
  struct container_cycle_data *cdata = (struct container_cycle_data*)data;
  int now;

  now = SDL_GetTicks ();

  if (now - cdata->last_change
      > opts[0].val.ival * 1000)
    {
      cdata->last_change = now;

      /* FIXME: add randomization support */
      if (cdata->current)
	cdata->current = cdata->current->next;
    }

  if (! cdata->current)
    cdata->current = cdata->children;

  if (cdata->current)

struct pn_actuator_desc builtin_container_cycle =
{
  "container_cycle",
  "Branched-execution Container",
  "A container that alternates which of its children is executed;  it "
  "can either change children randomly or go in order.",
  ACTUATOR_FLAG_CONTAINER, container_cycle_opts,
  container_cycle_init, container_cycle_cleanup, container_cycle_exec
};

164:0393aae79318

#include <stdio.h>

#include <glib.h>

#include "actuators.h"
#include "paranormal.h"

/* **************** all containers **************** */

/* Add a actuator to a container (end of list) */
void

/* **************** container_cycle ***************** */
static struct pn_actuator_option_desc container_cycle_opts[] =
{
  { "change_interval", "The number of seconds between changing the "
    "child to be executed", OPT_TYPE_INT, { ival: 20 } },
  { "beat", "Whether or not the change should only occur on a beat",
    OPT_TYPE_BOOLEAN, { bval: TRUE } },
  { 0 }
};

struct container_cycle_data
{
  GSList *children;
  GSList *current;
  int last_change;
  int last_beat;
};

static void
container_cycle_init (gpointer *data)
{

container_cycle_exec (const struct pn_actuator_option *opts,
		      gpointer data)
{
  struct container_cycle_data *cdata = (struct container_cycle_data*)data;
  int now;
  int new_beat = ((pn_sound_data->pcm_data[0][0]+pn_sound_data->pcm_data[1][0]) >> 7) >= 80 ? 1 : 0;

  /*
   * Change branch if all of the requirements are met for the branch to change.
   */
  if ((opts[1].val.bval == TRUE && new_beat != cdata->last_beat) || opts[1].val.bval == FALSE)
    {
       now = SDL_GetTicks();	

       if (now - cdata->last_change
           > opts[0].val.ival * 1000)
         {
            cdata->last_change = now;

            /* FIXME: add randomization support */
            if (cdata->current)
              cdata->current = cdata->current->next;
         }
    }

  /* reset the tracking for on-beat branch changing. */
  cdata->last_beat = new_beat;  

  if (! cdata->current)
    cdata->current = cdata->children;

  if (cdata->current)

struct pn_actuator_desc builtin_container_cycle =
{
  "container_cycle",
  "Branched-execution Container",
  "A container that alternates which of its children is executed;  it "
  "can either change on an interval, or only on a beat.",
  ACTUATOR_FLAG_CONTAINER, container_cycle_opts,
  container_cycle_init, container_cycle_cleanup, container_cycle_exec
};