The latest headlines about Ironbane.
Forum back online

My logo would've fit perfectly in that circle.

read more
0.4 released!

@cattymadness It's risky, but yes. I got past it by jumping to where there should be one, and then landing on a platform and continuing.

read more
General discussion about Ironbane.
OHH YEAH!!!

read more
Ask Ironbane

Dear @Will,

I eat souls. Sometimes I get lucky and catch an adventurer in the morning.

~Ironbane

read more
Discuss the mechanics that bring Ironbane alive.
The Colosseum - Official Discussion Post

@Thaiberius I guess that's true. Sounds pretty fun!

read more
Movable view

Try clicking with two fingers on the mouse pad at the same time. It will count as a right click. For this you would likely click and hold.

read more
Having trouble running the game? Are you stuck?
PASSWORD HELP

read more
Come on, don't be shy! Tell us a little about yourself!
The Quick Introduction Thread!

@ArcticNerd Heh, welcome to Ironbane! :)

read more
Thaiberius

@Will lel i was sensitive

Also I edited my intro

read more
We all hate 'em. And they breed too! Report them here.
THREE js

Which shader in particular are you referring to? We're just using the standard three.js library with no custom shaders AFAIK.

read more
Uh..Wut?

@Thaiberius Oh, Yep XD That worked Thankssss

read more
Just thought of something wickedly cool? Surprise us!
Make the castle accessible for loot and better experiences!!!!

@Mrgamer2015 We're thinking of not having levels. We went through a lot of discussions and decided it wasn't necessary.

read more
Newcomer to Professional

@Dragon ah gosh, yeah

EDIT: Fixed!

read more
Humble discussions that reach beyond Ironbane.
Some C++ Code...

I'm not sure if many of you know C++, but if you do, I'd like you to critique my work, if you can. Feel free to ask questions.

I am working on sorting algorithims next.

ArrayLists in and Sorting Algorithims in C++ (Pastebin)
List (GitHub)

Preview

/* Lists that can be manipulated qucikly and easily. With influence of Java ArrayLists (java.util.ArrayList) Author: Chaiyawat Nunes (chaiteanunes@gmail.com) (https://github.com/ChaiTeaNunes) Lisence: GNU GPL v2.0 (http://www.gnu.org/licenses/gpl.txt) */ #ifndef __LIST__ #define __LIST__ #include <typeinfo> /** * Lists that can be manipulated qucikly and easily. With influence of Java ArrayLists (java.util.ArrayList) * * @author Chaiyawat Nunes thaiberius.code@gmail.com * @version 1.0 */ template <typename TYPE> class List { private: /** * The object that will be manipulated for the list. */ TYPE * objects; /** * Size of the list. */ int size; public: /** * Returns the size of the list, which is crucial for sorting. * * @return the size of the list */ int getSize() { return size; } /** * Returns an object that can be manipulated and accessed. * * @param index the index to locate the object within the list * @return the object at the give index of the list */ TYPE &operator[](int index) { return objects[index]; } /** * Returns an object that can be manipulated and accessed. * * @param index the index to locate the object within the list * @return the object at the give index of the list */ TYPE get(int index) { return objects[index]; } /** * Sets all the whole list to be another list. * * @param list the new list */ void setList(List list) { if(typeid(list).name() == typeid(objects).name()) { objects = list; } } /** * Sets all the whole list to be another list. * * @param list the new list */ void setList(TYPE [] list) { objects = list; } /** * Sets all the whole list to be another list. * * @param list the new list */ void setList(TYPE * list) { objects = list; } /** * Sets the size of the list, trimming objects from the end and seting new objects to 0. * * @param newSize the new size of the list */ void setSize(int newSize) { TYPE * newObjects = new TYPE[newSize]; if (objects != nullptr) { for (int i = 0; i < newSize; i++) { if (i < getSize()) { newObjects[i] = get(i); } else { newObjects[i] = 0; } } delete[] objects; } setList(newObjects); setSize(newSize); } /** * Sets the object at the given index of the list. * * @param index the index to locate the object within the list * @param value the new value for the selected object */ void set(int index, TYPE value) { objects[index] = value; } /** * Adds an object to the end of the list. * * @param value the new value for the new object */ void add(TYPE value) { setSize(getSize() + 1); set(getSize() - 1, value); } /** * Adds an object at the given index and moves the objects after the index of the list. * * @param index the location of the new object */ void insert(int index) { setSize(getSize() + 1); for (int i = getSize() - 1; i > index; i--) { set(i, get(i - 1)); } set(index, 0); } /** * Adds an object at the given index and moves the objects after the index of the list. * * @param index the location of the new object */ void insert(int index, TYPE value) { setSize(getSize() + 1); for (int i = getSize() - 1; i > index; i--) { set(i, get(i - 1)); } set(index, value); } /** * Removes and object at the given index and moves the object after the index of the list. * * @param index the location of the new object */ void removeAt(int index) { for (int i = index; i < getSize(); i++) { set(i, get(i - 1)); } setSize(getSize() - 1); } /** * Swaps two objects in the list. * * @param index1 first index to swap * @param index2 second index to swap */ void swap(int index1, int index2) { TYPE temp = get(index2); set(end, get(index1)); set(index1, temp); } /** * Moves an object to a new place in the list. * * @param start the beginning location of the object * @param end the ending location of the object */ void move(int start, int end) { insert(end, get(start)); removeAt(start); } /** * Moves an object to the front of the list. * * @param index the location of the object to move to the front */ void moveToFront(int index) { move(index, 0); } /** * Sets an object of the list to 0. * * @param index the location of the object to set to 0 */ void reset(int index) { set(index, 0); } /** * Checks of the list is empty or not. * * @returns true if the size is 0 */ bool isEmpty() { return getSize() == 0; } /** * Checks if an object in the list is equal to the given value. * * @param index the location of the object to compare * @param value the value to compare * @returns true if the two objects have the same value */ bool equals(int index, TYPE value) { return get(index) == value; } /** * Flips all of the objects in the list. */ void flip() { TYPE * flipped = new TYPE[getSize()]; for(int i = 0; i < getSize(); i++) { for(int j = getSize() - 1; j <= 0; j--) { flipped[i] = j; } } setList(flipped); } /** * Checks to see if the given object of the list is 0. * * @param index the location of the object to compare * @returns true if the object's value is 0 */ bool isZero(int index) { return equals(i, 0); } /** * Checks if 0 is present in the list. * * @returns true if a zero is present */ bool isZeroPresent() { for (int i = 0; i < getSize(); i++) { bool foundZero; if(isZero(i)) { foundZero = true; break; } else { foundZero = false; } } return foundZero; } /** * Gets the index of the first 0 in the list. * * @returns the location of the first 0 in the list or 0 if there is not 0 present.] */ int getZeroIndex() { if(isZeroPresent()) { for (int i = 0; i < getSize(); i++) { if (isZero(i)) { return i; } } } else { return 0; } } /** * Clears the list. */ void clear(){ if (objects != nullptr) { delete[] objects; setList(nullptr); setSize(0); } } /** * O(n) and o(n^2) Bubble Sort */ void bubbleSort() { if(getSize() > 1){ for(int i = 0; i < getSize(); i++) { for (int j = 0; j < getSize() - j; j++) { if (get(j) > get(j + 1)) { swap(j, j + 1); } } } } } /** * Default Constructor. */ List() : objects(nullptr), size(0) { } /** * Parameterized Contructor. * * @param size the size of the list */ List(int size) : objects(nullptr), size(size) { setSize(size); } /** * Deconstructor. */ ~List() { reset(); } }; #endif

read more
Enter your topic title here

Found it digging through my topics: http://ironbane.com/topic/224/ask-ironbane

read more
Internal error.

Oops! Looks like something went wrong!