• 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.
Sign in to follow this  
Followers 0
Mira Maslow

Adding data from behind

2 posts in this topic

I  currently trying to modifying this code so it will adding new data from behind but it seems that I can only code it in front of the previous data.
I can't see what's wrong with it. Does it have to do with printitem() function? Here's my header. Hope that someone will help me since I'm a bit lost.
#ifndef list_h
#define list_h
template<class t>
class list
{
private:
	class node
	{
	public:
		t data;
		node*next;
	};
	node*head;
	node*current;
	int numitem;
public:
	list();
	~list();
	void addtofront();
	void addinmiddle();
	bool traverse(t,int&);
	void printdata();
	int numberofitem();
};
template<class t>
list<t>::list()
{
	numitem=0;
	head=0;
};
template<class t>
list<t>::~list(){};
template<class t>
void list<t>::addtofront()
{
	t item;
	node*newnode=new node;
	cout<<"enter data: ";
	cin>>item;
	newnode->data=item;
	newnode->next=head;
	head=newnode;
	numitem++;
};
template<class t>
void list<t>::printdata()
{
	current=head;
	while(current !=0)
	{
		cout<<current->data<<" ";
		current=current->next;
	}
	cout<<endl;
};
template<class t>
int list<t>::numberofitem()
{
	return numitem;
};
template<class t>
void list<t>::addinmiddle()
{
	t item;
	t node_number;
	cout<<"enter the item location: ";
	cin>>node_number;
	node*temp1;
	temp1=(node*)malloc(sizeof(node));
	temp1=head;
	for(int i=1;i<node_number;i++)
	{
		temp1->next;
		if(temp1==NULL)
		{
			cout<<node_number<<" location is not exist"<<endl;
			break;
		}
	}
	cout<<"enter new item: ";
	cin>>item;
	node *temp;
	temp=(node*)malloc(sizeof(node));
	temp->data=item;
	temp->next=temp1->next;
	temp1->next=temp;
};
template<class t>
bool list<t>::traverse(t target,int &loc)
{
	if(numitem==0)
	{
		cout<<"there is no item in the list. "<<endl;
	}
	else
	{
		current=head;
		loc=0;
		while(current->data !=target&& current->next !=0)
		{
			current=current->next;
			++loc;
		}
		if(current->data==target)
			return true;
		else
			return false;
	}
};
#endif
Edited by Hodgman
Added [code]...[/code] tags.
0

Share this post


Link to post
Share on other sites

Please put your code in code tags so it's readable.

I haven't read your code exhaustively in that regard, but are you saying that you can only add items to the front of the list?  That seems to be the behavior you're after in the first place, since you've only got methods to add to the front and middle.

 

If you want to add to the rear, I'd suggest having a tail pointer as well as a head.

0

Share this post


Link to post
Share on other sites

You obviously didn't write this thing yourself, and it looks like you are asking us to complete your school work for you.

We can help you get started, though.

 

For starters, there is a function called addtofront() and addinmiddle() which both asks for user input for some reason, instead of taking in these values as function parameters.

Second, you will need a new function, which we could call addtoback()

 

To add something to the back of a linked list (- this variation being one of the most useless structures in existence,) traverse the entire thing to the last end, and have its next pointer point to a new node that you just "added" with addtoback()

 

Typically, when you want to add something to a structure, you would want something to add, from somewhere, say, from the parameter list of a function:

template<class t>
void list<t>::add_back(const Node& node)

1

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0