bumpity bump

I still haven't booked, but I just won a ticket, so I might still go!

I want to fly out of RDU for GDC on March 13th, and return on the 19th. I'm going alone as a rep for my studio to network with some clients, friends, and publishers. I know we have a lot of devs throughout NC, considering we've got Epic, Red Storm, Puny Human, and all the others in RTP, but we've always been pretty bad about organizing meetups. Anyway, if anyone wants to come with me, we can book together, and split room costs and such. I'm going to book in the next few days, so hurry up if you're thinking about it!

I'm there for business, but I hope to hit as many parties as I feasibly can as well.

_{I tweeted about this if anyone would be so kind as to RT me.}

That example track doesn't load for me.

I just remixed The Starr Wolf from Starr Mazer:

https://soundcloud.com/gazinlesbians/alex-mauer-the-starr-wolf-gazinlesbians-remix

Also, Futurecop!:

https://soundcloud.com/gazinlesbians/futurecop-yfl-gazinlesbians-remix

I sent an email to the address in your profile 

Ok, I don't totally understand your goal either, but maybe something I say will be helpful.

1. Can you draw a picture of what you're looking for?

2. Is f(x) a discrete function?

3. Do you know about polynomial regression?

. Some of the best mixing on the planet.

If you must use a vector, then you'll have to iterate through, checking each element. Two things that could make that faster though are either 1. Sorting the vector so that you don't have to iterate over EVERY element and/or 2. Checking for uniqueness on insertion.

If you can use something other than a vector, look for an implementation of the Set data structure, or another data structure that forces uniqueness, in AS3. Alternatively, you can get away with using a normal AS3 Dictionary.

I've got this strong sense of pride in the forum for solving this problem. It could have been a really tough one...but boom, collaboration, and solution.

Praise Pit.

So, even if you remove the intantiation entirely, right now, your display works properly?

I would start with a 2D grid.

You start by defining world-space dimensions for the cells of the grid. The ideal choice of dimensions is game dependent, and relates to the size and distribution of objects in your world. Represent a GridCell as a vector of object references. Represent a Grid in such a way that you can index GridCell objects by their grid-space coordinates. You can determine the grid-space coordinates for any point with a very simple function. Something like this:

Code:

-- given a grid of infinite squares of cell_dim,
-- gets the grid coordinates for a point in the world
function get_grid_coords(pos, cell_dim)
   return floor(pos.x / cell_dim), floor(pos.y / cell_dim)
end

You'll use these coordinates to index into your Grid.

Every time something moves, use this function to determine the grid-space coordinates, and add a reference to this moved object to the GridCell that it currently resides in. Of course, also remove it from any GridCell that it no longer resides in.

THEN

To find nearby objects, you first find the grid-space coordinates of an object, and then you use them to index into the Grid to get the GridCell, which contains references to all of the objects in the same GridCell as the object in question.

If it's 3D, you probably want an octree. If it's 2D, a quadtree would be good, but I would only bother with either if a fixed grid wasn't sufficient for your needs.

[v]

You can find the acceleration of the mouse as follows:

Let mouse_1 be the current position of the mouse and mouse_2 be the position of the mouse from the prior frame. Further, v is velocity, a is acceleration, and dt is the time between frames/readings. Then,

v = (mouse_1 - mouse_2) / dt

a = (v_1 - v_2) / dt

Really, you probably want to keep a running average of accelerations over the past n frames, or something like that, to smooth out the values.

How about slight inconsistencies in facts and playing with the time between presenting each line of dialogue? Someone anxious will deliver lines quickly. Someone taking time to think of their answer will take longer pauses between lines.

As it says, you're comparing a value of type KeyboardEvent (e) with a value of type uint (Keyboard.SPACE). Keyboard.SPACE is a "Constant associated with the key code value for the Spacebar," so you should actually be comparing it with e.keycode.

Code:

function movement(e:KeyboardEvent){
    if(e.keycode == Keyboard.SPACE){
       trace("Hello")
    }
}

Change the path to "assets/sound.mp3"

I don't know Unity in particular, but I searched around for your problem. I found this thread, and the problem described is almost exactly the same except that OP there is using deferred rendering. Anyway, if you haven't seen that thread, you may find it useful.

First I would quadruple check your assertion that nothing has changed, codewise, between it working and not working. There are cases in GM where things won't be caught by the syntax checking, nor will errors be thrown when something breaks as a result. If you've eliminated your own code as a possibility, the following should help you track down and/or fix your problem:

- Have you restarted (the computer/GM)?

- Will your game run in debug mode? (red play symbol)

- Will your game run when you build it as a standalone executable? (the button to the left of the green play symbol)

- Try making an empty test project. Does it run?

It's the lyrics to "Never Gonna Give You Up," one of my favorite songs.

I found this database of word frequencies, which you could definitely use with just a little bit of processing.

Apart from that, Dictionary.com has an API, but I don't think it exposes the "difficulty index" of the word, which is otherwise exposed on the definition pages. You could pretty easily scrape the definition pages for the difficulty index though, it's right here:

Code:

<section data-imp="6ta766" data-difficulty="73" id="difficulty-box">

How many words do you want though? You could use word lists or this configurable word generator to manually assemble your database, and I think you could do at least 100 words per hour, probably even more.