MathGroup Archive 2012

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Making a stack.

  • To: mathgroup at
  • Subject: [mg128465] Re: Making a stack.
  • From: Fred Simons <f.h.simons at>
  • Date: Tue, 23 Oct 2012 00:53:57 -0400 (EDT)
  • Delivered-to:
  • Delivered-to:
  • Delivered-to:
  • Delivered-to:
  • References: <>

The function AppendTo has attribute HoldFirst; you want to pass the name 
queue into the body and not the value. Therefore your function enqueue 
must have attribute HoldRest:

In[3]:= Attributes[enqueue] = {HoldRest};

In[5]:= queue={1,2,3}; enqueue[4, queue]
Out[6]= {1,2,3,4}

Kind regards,

Fred Simons
Eindhoven University of Technology

Op 22-10-2012 8:03, Brentt schreef:
> Hi, I'm trying to make stack functions like enqueue and dequeue to
> demonstrate algorithms. I know enqueue would do pretty much the same thing
> as AppendTo, but I want the arguments reversed and it to be called
> "enqueue". I figured this would work:
> enqueue[x_, queue_] := AppendTo[queue, x];
> But it spits out red. I tried to tinker with the evaluation order but to no
> avail. Is anyway to make this work? I want the functions to work like they
> would in a procedural language (I'm not using a procedural language because
> I want to accompany the algorithms with visualizations---i.e. it's for a
> demonstration project). I know I can just use Set when I want to que
> something, but I was hoping to figure out a way to make the code look like
> procedural code, and I'm guessing Mathematica is flexible enough to do
> that.
> Any ideas?

  • Prev by Date: Making a stack.
  • Next by Date: Re: Separating functions
  • Previous by thread: Making a stack.
  • Next by thread: Re: Making a stack.