Bryan Head

Bryan Head has asked 14 questions and find answers to 30 problems.

Stats

About

I'm a PhD student in Computer Science at Northwestern. I work on all thing NetLogo.

Bryan Head questions

Avoiding the use of type() comparisons where polymorphism won't work
Statically allocate arrays of instances of derived class and arrays of pointers of base class with minimal repetition and code size
Is it possible to create a temp index in sqlite?
Recursively matching filenames with glob argument
Get all links connecting turtles in a turtle-set efficiently in NetLogo
Summing with a for loop faster than with reduce?
git subtree push and split adding "-n<newline>" to commit messages
Java sort via Comparator<T> spends majority of its time in compare(Object,Object)
Java Performance - ArrayLists versus Arrays for lots of fast reads
List lookup faster than tuple?

Bryan Head answers

Netlogo - Origin in the corner with code
NetLogo - how to give each patch an unique identity / plabel / name
Statically allocate arrays of instances of derived class and arrays of pointers of base class with minimal repetition and code size
NetLogo - Setting a parameter to an Integer
Development of turtles from one breed to another
turtle setup with even spacing in xcor and ycor
How can I count dead turtles in Netlogo
NetLogo Efficiently create network with arbitrary degree distribution
NetLogo Efficient way to create fixed number of links
The path does not reach the end node in my A* algorithm