Search:

I think it might be better if I simply transfered my program into windows first.

I have programmed in WIN32 before, but it has been a while.

Any suggestions on what I might use as the lay out...

Yes, how do I go about outputing RTF? Is there an article on it?

Thanks.

Thanks, it works now with this method. I was trying get a minute ago and it inserted extra characters.

Now to finish seperating into functions and alow for simultaneously allowing for multiple...

Could I use the ignore()? How do I ignore all of the say spaces or /n characters and just read in all of the text characters in file?

Thanks.

How do I set the character it stops reading at? It is stopping at /n right now, but I wanted it to read the whole file all the way through.

Thanks.

Its working now as output to a file. I am not sure how to output in color text though.

Thanks.

Yes, its working now.

I am seperating everything into working functions as my next step.

After that I will transfer the output to a file. The ouput being a grid doesn't seem to tough to manage....

This is what I am doing:

// open the file to read in the text
ifstream file;
file.open(TEXTFILE);

Thanks.

I have read through the tutorial to refresh my memory on files. I am trying to get the file name as input from the user.

It doesn't want to except a string, char, or char array or a pointer for...

I have greatly modified this code and I am now using some different methods.

My code now looks like this (a little messy, but I'll fix that in a bit):


#include <cstdlib>
#include <iostream>...

I inserted this code to write the matrixes if a word is found:


for(int c = 0; c <= TEXT.size(); c++)
{
cout<<TEXT[c];
++s;
if(s == SKIP)
{
...

Yes, and I only found one program to do ELS on ASCII and it did not have a feature to analyse words that occured on the same skip and their proximity. I am making mine with this feature and and a...

So far I have found this that solves the lllama error:


if(SEARCHWORD[SUBSTRINGLIST[j].size()] == TEXT[i] || SEARCHWORD[SUBSTRINGLIST[j].size()] == TEXT[i + 1])
{
...

Ok here is the corrected code thus far:


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

using namespace std;

Yes, I just thought about the lllama error, and I am working on it.

I also changed my output statement to tell me the position of the first letter of the word found:


coutcout<<endl<<"Search...

Here is the adjusted code:


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

using namespace std;

Yes thats much clearer. I'll adjust my code appropriatley. I see now why the original would not have worked.

Thanks.

I inputed my first example. It didn't find it. Am I doing something wrong here?

Thanks.

I replaced SUBSTRINGLIST[SUBSTRING].clear() with just SUBSTRINGLIST.clear()

It fixed the abrupt exit, but I don't think the code is working. Have I coded this algorithm correctly?

Thanks.

Here is what I have so far. I am not extremely familiar with vectors and I think I may have interpreted your algorithm incorrectly. I am getting an error after I input the variables. The program...

Thanks alot for that. I am going to write some code now based on the ideas I collected here and I'll post what I have been able to do.

Thanks.

Could I use the string copy function in order to split up the master string into smaller intervals of the skip?

Thanks.

Here is a specific question that I need an answer for in order to implement this first algorithm:

Is there a preset way to set part of a string array to another string array?

Thanks.

Thanks for the help.

Yes I have already read all of that. I know how it works mathematically. I need to know how I might do the searching and seperating efficiently in C++.

Thanks.

Here is one with a skip of four:

NOMANKNOWSMYNAME

NOMA
NKNO
WSMY
NAME

This shows ASK imbedded with a negetive skip of four (that is searching from the end forward for the search word).