Statalist The Stata Listserver


[Date Prev][Date Next][Thread Prev][Thread Next][Date index][Thread index]

RE: st: -generate- and run time contingencies


From   Nick Winter <[email protected]>
To   [email protected]
Subject   RE: st: -generate- and run time contingencies
Date   Mon, 30 Jan 2006 12:19:33 -0500

For this example, something like that is fine, but I think the need was for something more general, where actual looping might be necessary.

--Nick

At 12:17 PM 1/30/2006, you wrote:

Is there anything wrong with the following?

gen x = .8 + .2*uniform()

Or am I missing the point?

David

-----Original Message-----
From: [email protected]
[mailto:[email protected]] On Behalf Of Richard
Williams
Sent: 30 January 2006 16:37
To: [email protected]
Cc: [email protected]
Subject: Re: st: -generate- and run time contingencies

At 11:15 AM 1/30/2006, n j cox wrote:
>// not tested, but simplified
>gen x = uniform()
>capture assert x >= 0.8
>
>while _rc {
>         replace x = cond(x < 0.8, uniform(), x)
>         capture assert x >= 0.8
>}

That works too.  It seemed a little quicker but I didn't time it.

______________________________________________________________________
This email has been scanned by the MessageLabs Email Security System.
For more information please visit http://www.messagelabs.com/email
______________________________________________________________________

*
*   For searches and help try:
*   http://www.stata.com/support/faqs/res/findit.html
*   http://www.stata.com/support/statalist/faq
*   http://www.ats.ucla.edu/stat/stata/
________________________________________________________
Nicholas J. G. Winter 607.255.8819 t
Assistant Professor 607.255.4530 f
Department of Government [email protected] e
Cornell University falcon.arts.cornell.edu/nw53 w
308 White Hall
Ithaca, NY 14853-4601

*
* For searches and help try:
* http://www.stata.com/support/faqs/res/findit.html
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/




© Copyright 1996–2024 StataCorp LLC   |   Terms of use   |   Privacy   |   Contact us   |   What's new   |   Site index