//  usage:  anagram  word
//  So far just works on single word s, i.e. it doesn't take phrases as
// input and can't rearrange a single word into several smaller words.
//#include <iostream>
#include <fstream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <stl.h>


using namespace std;

int main(int argc,char *argv[])
{
  if (argc==1) {
    cout << "usage:  anagram  word " << endl;
    system("pause");
    return 0;
  }

  char name[100];
  char newname[100];
  strcpy(name,argv[1]);
  strcpy(newname,argv[1]);
  int length=strlen(name);

 

// read in dictinary and move to vector<string> v
    ifstream in("BigWordList.txt");
    if(in==NULL)
       cout << "BigWordList.txt needs to be in same folder as anagram.exe" <<  endl;

     vector<string> v;
     istream_iterator<string> input(in);
     istream_iterator<string> end;
     back_insert_iterator<vector<string> > dest (v);
 
     copy(input, end, dest);

     vector<string>::iterator v_iter1(v.begin());
     vector<string>::iterator v_iter2(v.end());

// calculate all permutations
     vector<int> A;
     for (int i=0;i<length;i++)
        A.insert(A.end(),i+1);


     vector<int>::iterator iter1(A.begin());
     vector<int>::iterator iter2(A.end());

     vector<int> w;
// get w set up with 1,2,... length
  for (int i=0;i<length;i++)
     w.insert(w.end(),i+1);


  while (next_permutation(iter1,iter2))  {

     // copy(iter1,iter2,dest_w);
     copy(iter1,iter2,w.begin());

      for(int j=0;j<length;j++){
         newname[j]=name[w[j]-1];
      } // for(int j

     string *pNewname=new string(newname);
      if(pNewname==NULL){
        cout << "error: no memory for pNewname" << endl;
        return 1;
      }

      if(binary_search(v_iter1,v_iter2,*pNewname)==true)
         cout << *pNewname <<  endl;
      delete pNewname;

 }// end while loop


     cout << "program finished successfully" << endl;

     return 0;
}