C++ Wurfl tools
by Emmanuel Papirakis

The C++ Wurfl tools are a set of C++ classes that allow you to querry the Wurfl database through an object oriented interface. Although C++ is not a language that is traditionaly viewed as a web oriented language, it is widely used to write server code for various applications that might benefit from the WURFL even though they are not integrated into a web server.

This package has two external dependencies:

• Boost
• libxml2

#include <wurfl/wurfl.h>
#include <iostream>

#define WURFL_PATH "../wurfl.xml"
#define USER_AGENT "Mozilla/5.0"

using namespace std;
using namespace WURFL;

int main(int argc, char **argv)
{
	Wurfl w(WURFL_PATH);
	CapabilityEntry::Ptr cap(w.GetCapability(USER_AGENT, argv[1]));
	
	if (!cap) {
		cerr << "Bad capability: "
		     << argv[1]
		     << endl;
		return -1;
	} else {
		cout << "The value of capability: "
		     << argv[1]
		     << " "
		     << "for user-agent: "
		     << USER_AGENT
		     << " "
		     << "is: "
		     << cap->GetValue()
		     << endl;
		     return 0;
	}
}

• The system does not have enough momory to hold all of the entries
• The XML file is malformed
• The Wurfl file does not follow the DTD correctly

• The user-agent as advertized by the browser
• The name of the capability to look for

#include <wurfl/wurfl.h>
#include <iostream>

#define WURFL_PATH "../wurfl.xml"
#define USER_AGENT "Mozilla/5.0"

using namespace std;
using namespace WURFL;

int main(int argc, char **argv)
{
	Wurfl w(WURFL_PATH);
	DeviceEntry::Ptr dev(w.GetDeviceEntry(USER_AGENT));
	
	for (;;) {
		CapabilityEntry::Ptr cap(dev->GetCapability(argv[1], false));
		
		if (!cap) {
			if (dev->GetId() == "generic") {
				cout << "No such capability: "
				     << argv[1]
				     << endl;
				break;
			}
			dev = w.GetDeviceEntryByID(dev->GetFallback());
		} else {
			cout << "The value of capability: "
		    	 << argv[1]
		    	 << " "
		    	 << "for user-agent: "
		    	 << USER_AGENT
		    	 << " "
		    	 << "is: "
		    	 << cap->GetValue()
		    	 << endl
		    	 << "The ID of the DeviceEntry which it was found is: "
		    	 << cap->GetDeviceID()
		    	 << endl;
			break;
		}
	}
}

class Mutex
{
public:
	void Lock()
	{ }
	void Unlock()
	{ }
};

void f()
{
	std::string s1 = "Hello world";
	std::string s2 = s1;
	
	std::cout << &s1.c_str()[0] << " " << &s2.c_str()[0] << endl;
}

template<typename T>
struct List
{
	typedef std::list<T> type;
};

#include <QList>

template<typename T>
struct List
{
	typedef QList<T> type;
};

• It is the only standard associative container as of this writting.
• It the associative container that requires the least dynamic memory.
• It performed acceptably well throughout our tests.

• std::map
• tr1::unordered_map
• std::hash_map
• google::sparse_hash_map
• google::dense_hash_map