MAPPING

[DSTR3A]

I'm trying to run a MAP to see if any of these strings are in the data[i] part.
It should return either a 1 or a 0.

This is what I have so far.

#include <stdio.h>
#include <iostream>
#include <map>
using namespace std;
void printRawData(unsigned char *data, int length, int more)
{
	int i, c=0;
	printf("     -------------IP Data Begins-------------\n");
	for (i=0; i<length;>	{
		if ((data[i]>30 && data[i]<122) || 
			(((data[i]==10) || (data[i]==13) || (data[i]==123) || (data[i]==125))
            && (more>0)))
		{
			printf("%c", data[i]);
			c+=1;
			//////////////////////////////////////////////////////
			map<int,> mymap;
			int c;
			mymap [1] = "audio/basic";
			mymap [2] = "audio/x-aiff";
			mymap [3] = "audio/x-wav";
			mymap [4] = "video/mpeg";
			mymap [5] = "video/mpeg-2";
  			mymap [6] = "video/quicktime";
			for (c=1; c<6; c++)
			{
			cout << c;
			if (mymap.count(c)>0)
				cout << "Found A Match!\n";
			else 
				cout << "No Match Is Found.\n";
			}
			return;
			////////////////////////////////////////////////////
			//c+=1;
        }
		else
		{
			//printf("[%i]", data[i]);
			c+=3;
			if (data[i]>9) c++;
			if (data[i]>99) c++;
                }
		if (c>=47)
		{
			printf("\n");
			c=0;
                }
       }
}

[helios]

A map won't help you. You'll have to search for each of the strings in data.

[DSTR3A]

OK, How would I do this?

[helios]

An easy way could be

std::string s(data,length);
for (/*...*/)
    if (s.find(strings[i])!=s.npos)
        //s contains strings[i] 

You'll have to get more clever if copying data isn't acceptable or if there's some preprocessing needed before searching.

[DSTR3A]

I think I'm beging to understand, but being new would you be able to expand a little on this? Thank You.

[helios]

I've made it as simple as it can be so even a beginner can understand what it does. If I expand, it'll become more complicated.