• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.

mapPhil

Members
  • Content count

    22
  • Joined

  • Last visited

Community Reputation

103 Neutral

About mapPhil

  • Rank
    Member
  1. Thanks haegarr, that sound's like a great solution to my problem. Do you know of any tutorials/examples of how to do this?
  2. Apologies for the lack of detail. [quote name='BitMaster' timestamp='1354269477' post='5005645'] For something as tiny as 10000 (int, string, int) I see no problem with keeping the data in memory. [/quote] I am creating a list for a GUI and considering the the amount of data in the list could be exponential, even larger than 10,000 - though it's unlikely it is certainly possible. On top of this I am my list can handle a varied amount of columns. All of the data will actually be strings, even in the example in my first post. I have not used the file libraries much, but the code I wrote is this to create the file: [CODE] std::ofstream file; file.open("data.bin", std::ios::in | std::ios::out | std::ios::binary | std::ios::app); std::string str = "0,Hello World,0"; std::string::size_type sz = str.size(); if (file) { for(int i = 0; i < 10000; i++) { file.write(str.c_str(), strlen(str.c_str())); file << std::endl; } } file.close(); [/CODE] If this is incorrect please let me know. Note: I actually won't be creating the binary file myself, only receiving the file and reading the data in FetchData method. The main problem presented is my list works perfectly fine up until I require the 4000th row then It becomes noticeably slower, this is because I am iterating through the file until I reach the index required.
  3. hi all, Basically I want to find the quickest way in which to search for data quickly, from a binary file. For example my bin file will contain data such as: 0,Hello World,0 0,Another World,1 Now I would like to search for each new line of a 10,000 (possible more) .bin file. Currently I am doing it this way: [CODE] void FetchData(const unsigned int& line,int column, std::string& data) { if (file) { // reset file pointer to beginning file.clear(); file.seekg(0, std::ios::beg); if (fs.good()) { // search for the desired line and exit loop for (int i = 0; i < (line+1) && file.eof() == false; i++) { std::getline(file,data); } } } } [/CODE] This does work, but are there any more efficient approaches I could take? I am also required to modify such data, but I am currently storing the .bin file in a vector temporarily and the modify particular elements of the vector and then overwrite the existing .bin file with the latest data. If there is a more efficient approach to this please let me know? Also on a side note, how would performance differ between using an .xml instead of a .bin file ? Thank you for any help offered.
  4. Hi, Can anyone recommend a resource for me to learn how to effectively do this? Only 7 images will be visible at once.
  5. I would like to know how I do the bounce effect which is like the one that appears on the iPhone when you scroll up fast and reach the end. I currently have the swipe and can detect when I reach the end. So when I reach the end I have the current position and the velocity in which the swipe travelled at? Any help will be appreciated
  6. [quote name='BeerNutts' timestamp='1322510204' post='4888553'] Here's how I would do it: [code] // StartTime is the time you started // ROTATION_TIME is the time you want it to rotate from 0 to 90.0f delta = CurrentTime - StartTime; RotationDegrees = 90.0f * (delta/ROTATION_TIME); [/code] Basically, as time passes, delta will get closer and closer to ROTATION_TIME, which means (delta/ROTATION_TIME) will get closer and closer to 1. So, when it's 1, it will have rotated 90 degrees. You stop when (CurrentTime - StartTime) == ROTATION_TIME [/quote] Thank you, would start time be the [color="#1C2837"][size="2"]animTimeDelta then?[/size][/color] Would this also work when the rotation is relative?
  7. Hi I want to rotate an object based on time using the x axis and rotating to 90 degrees I so far have but I know it's wrong? Any help would be great. float currentTime = time; float delta = currentTime - animTimeDelta; float delta = (90.0f * delta) / rotationTime; // rotation time will be 0.6f rotation_value += delta; if(rotVal > 90.0f) rotVal -= 0.0f; // should rotate the object using rotVal?? animTimeDelta = currentTime;
  8. Thank you for all the replies, I have solved it myself fortunately using the law of sines, right triangle and a ormula I developed, Oh and what I meant by a new polygon being added up, was that I would start off with 3 polygons for the triangle (no top face or bottom face). And then add another polygon to the scene to turn it into a square and so on, until there 360 polygons.
  9. [quote name='apatriarca' timestamp='1320774322' post='4881818'] Are the edges described in some order (i.e. clockwise)? Are the polygons convexes? In what coordinate system should the centre be described? Do you know something else? [/quote] Sorry if i wasn't descriptive. I start off with a 3d triangle in 3d space (x,y,z). The polygons are convexes. The things i would know = Centre point of the 3d triangle. The dimensions of each polygon. All the polygons will be the same height and width. A new polygon (4 vertices) will be added up until there are 360 sides.
  10. you have the length of each side, but the number of sides is ever changing for example a triangle will turn into a square and then into a octagon. How would i go about finding the centre point each time? Thanks
  11. Hi, I know how to create a digital clock using #include<time.h> but will this header allow me to set the time as well? if anyone can point me in the right direction that will be great. Thanks
  12. Lets say you have a class called spaceship and that class inherited a weapon class and an asteroids class. All of these classes feature a void controls function, would you declare all of the occurrences of the controls function virtual considering the spaceship class is inheriting it from two headers? I know it would compile but what is the recommended way? Thanks
  13. ^Yeh i know, i was just trying anything to get it to work [quote][color="#1C2837"][size="2"]'d have to see more context to know for sure, but it seems to me like the problem is you copy the high score into the top slot, then notice that it should displace all the other scores below it, and move them down; problem is, each score moved down is still "equal to" the high score, because the old high score is identical. So you again shift down the list, rinse, repeat, until all the slots are full of the same entry.[/size][/color][/quote] That was it thank you, i just needed to to clear the points at the end of the if statement
  14. Out of curiosity is there a reason why my code example would not work?
  15. [quote name='ApochPiQ' timestamp='1308604081' post='4825656'] Why not just add all the high scores to a container, sort it, and then remove the lowest n entries until you get to the maximum number of high scores you want to display? [/quote] Yeh that sounds easy enough, will give that a try, thanks