Thread: strange error... someone help please///

hi this is the class, implementation and main of my solution... and the error.. can some one please check it for me and let me know what is the problem? thank you..

this is the class code

Code:

#include <string>
#include <iostream>
#include <vector>
#include "stringset.h"

using namespace std; 


class InvertedIndex 
{
//insert data member here
  vector <StringSet> list;

public:
 
  // Tally adds one word/file pair to the index 
  void tally(string word, string file);

this is the implementation code

Code:

#include "inverted_index.h"
#include "osdir.h"


int InvertedIndex::size()
{
    return list.size();
}

// InvertedIndex::tally
//   Pre: a word and file pair as strings
//   Post: adds the file to the index under word
 void InvertedIndex::tally(string word, string file) 
{
      list.push_back(word);
}

and this is main code

Code:

#include "inverted_index.h"
int main() 
{

  StringSet ss;

  ss.insert("one");
  ss.insert("two");
  ss.insert("three");
  ss.insert("one");
  

  ss.print();
  if ( ss.contains("one") ) 
    cout << "ok - contains('one')\n";
  else
    cout << "fail - contains('one')\n";
   
  // test the InvertedIndex 
  InvertedIndex idx;
  idx.tally("nissan", "car.txt");
  idx.tally("nissa", "carbrand.txt");
  idx.tally("nissan", "everything.txt");
  idx.tally("honda", "hondacar.txt");

i just want to insert those data into list.....

the error is

L:\assignment 2\inverted_index.cpp In member function `void InvertedIndex::tally(std::string, std::string)':

26 L:\assignment 2\inverted_index.cpp no matching function for call to `std::vector<StringSet, std::allocator<StringSet> >:ush_back(std::string&)'

note L:\Portable\PortableDev-Cpp\Dev-Cpp\include\c++\3.4.2\bits\stl_vector.h:557 candidates are: void std::vector<_Tp, _Alloc>:ush_back(const _Tp&) [with _Tp = StringSet, _Alloc = std::allocator<StringSet>]

L:\assignment 2\Makefile.win [Build Error] [inverted_index.o] Error 1

so can someone let me know what should i do ? or give me some hints.... please... reallly frustrated on this kinda stuff....

i am trying really my best to find it out but... end up with smashing my table..

any help will be appreciated..

is there any other way to do it to make it like the list below?

vector IDX

--------------------------------------------------------
nissan | car.txt carbrand.txt everything.txt |
--------------------------------------------------------
honda | hondacar.txt |
---------------------------------------------------------

just want to insert vector that looks like

vector IDX

--------------------------------------------------------
nissan | car.txt carbrand.txt everything.txt |
--------------------------------------------------------
honda | hondacar.txt |
---------------------------------------------------------

Create an object of type StringSet and give it the word and the file information (presumably it stores strings inside somehow). Then call push_back on the vector with that object so that you are adding a StringSet to the vector.

Originally Posted by Daved

Create an object of type StringSet and give it the word and the file information (presumably it stores strings inside somehow). Then call push_back on the vector with that object so that you are adding a StringSet to the vector.

hi daved .. this is my stringset class

Code:

#include <vector>
#include <string>
#include <iostream>

using namespace std;
// StringSet
//  Class holding a set of strings
class StringSet 
{
 private: 

  vector <string> contents;
 
 public:
  // insert a value into the set
  // Pre: a string value
  // Post: the value is inserted into the set if it 
  //      is not already present
  void insert(string value);
  
  // test for a value
  // Pre: a string value
  // Post: returns 1 if the value is present in the StringSet, 0 otherwise
  int contains(string value); 
  
  // intersection of this set with another
  // Pre: a StringSet object
  // Post: returns a new StringSet which is the intersection 
  //       of this  with otherset, ie. only the items common to both StringSets
  StringSet set_intersection(StringSet otherset);
  
  // union of this set with another
  // Pre: a StringSet object
  // Post: returns a new StringSet which is the union 
  //       of this  with otherset, ie. the items in either StringSets
  StringSet set_union(StringSet otherset);          
  
  
  // print
  // Pre: None
  // Post: the stringset will be printed to cout
  void print();
  
};