Using MAUtil Set, Map, HashMap

Map

/**
 * @file Map.cpp
 * @author Naveed Asif
 *
 * Description:
 *
 *  In this tutorial we will learn the use of Map
 *  data structure. Initially a list of friends is
 *  created and then the Iterator's methods begin(),
 *  erase(), and find() are used.
 */

#include <MAUtil/Moblet.h>
#include <conprint.h>
#include <MAUtil/Map.h>
#include <MAUtil/String.h>

using namespace MAUtil;

class MyFriend
{
private:
	String myName;
	String myAddress;

public:
	MyFriend(String name, String address)
	{
		myName = name;
		myAddress = address;
	}

	void show()
	{
		printf("%s, %s", myName.c_str(), myAddress.c_str());
	}
};

class MyMoblet : public Moblet
{
public:
	// Map is declared.
	Map<String, MyFriend*> myFriends;

	MyMoblet()
	{
		// Add some friends.
		addFriend("Rupert Bear", "Norwood, England");
		addFriend("Ghuman", "Stockholm, Sweden");
		addFriend("Windy Miller", "Trumpton 2323");

		// Shows the original dictionary in the console.
		// Note: The dictionary values will be displayed in
		// ascending order.
		showDictionary();

		// Finds a friend using the find method and displays it
		// in the console.
		printf("--------------");
		printf("Found friend:");
		MyFriend* myFriend = myFriends.find("Rupert Bear")->second;
		myFriend->show();

		// Locates and erases a friend.
		myFriends.erase("Ghuman");

		// Look at the dictionary and notice that "Ghuman" is erased.
		showDictionary();

		// Finds the first entered friend.
		printf("--------------");
		printf("My first friend is:");
		Map<String, MyFriend*>::Iterator iter = myFriends.begin();
		iter->second->show();
	}

	/**
	 * Add a new friend to the dictionary.
	 */
	void addFriend(String name, String address)
	{
		myFriends.insert(name, new MyFriend(name, address));
	}

	/**
	 * Called when a key is pressed on the keypad.
	 */
	void keyPressEvent(int keyCode, int nativeCode)
	{
		if (MAK_BACK == keyCode || MAK_0 == keyCode)
		{
			close();
		}
	}

	/**
	 * showDictionary function is used to display all the
	 * pair values in myFriends Map function
	 */
	void showDictionary()
	{
		printf("--------------");
		printf("I've got %d friends:", myFriends.size());
		for(Map<String, MyFriend*>::Iterator iter = myFriends.begin();
			iter != myFriends.end();
			iter++)
		{
			iter->second->show();
		}
	}
};

/*
 * Main function where the program starts
 */
extern "C" int MAMain()
{
    Moblet::run(new MyMoblet());
    return 0;
}

HashMap

The HashMap works same like Map does except that Map always displays results in ascending order. You can simply change Map to HashMap in above example and it will work.

Similarities

Differences