X-Git-Url: https://git.sesse.net/?p=freerainbowtables;a=blobdiff_plain;f=Client%20Applications%2Fconverti2%2FPublic.h;fp=Client%20Applications%2Fconverti2%2FPublic.h;h=0000000000000000000000000000000000000000;hp=6c15430388ee3fa4c8f2e9ee0cf956463c663011;hb=86bbf0fd5ba4e07d3279b4179fd8fc808198eaae;hpb=3d42602c1f746b5768f0e6c9d22884a9806eadc0

diff --git a/Client Applications/converti2/Public.h b/Client Applications/converti2/Public.h
deleted file mode 100644
index 6c15430..0000000
--- a/Client Applications/converti2/Public.h	
+++ /dev/null
@@ -1,113 +0,0 @@
-/*
- * freerainbowtables is a project for generating, distributing, and using
- * perfect rainbow tables
- *
- * Copyright (C) Zhu Shuanglei <shuanglei@hotmail.com>
- * Copyright 2009, 2010 Daniël Niggebrugge <niggebrugge@fox-it.com>
- * Copyright 2009, 2010 James Nobis <frt@quelrod.net>
- *
- * This file is part of freerainbowtables.
- *
- * freerainbowtables is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 2 of the License, or
- * (at your option) any later version.
- *
- * freerainbowtables is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with freerainbowtables.  If not, see <http://www.gnu.org/licenses/>.
- */
-
-#ifndef _PUBLIC_H
-#define _PUBLIC_H
-
-#include <stdio.h>
-
-#include <string>
-#include <vector>
-#include <list>
-
-#include "global.h"
-
-using namespace std;
-
-struct RainbowChain
-{
-	uint64 nIndexS;
-	uint64 nIndexE;
-};
-
-struct RainbowChainCP
-{
-	uint64 nIndexS;
-	uint64 nIndexE;
-	unsigned short nCheckPoint;
-};
-struct IndexChain
-{
-	uint64 nPrefix;
-	int nFirstChain;
-	unsigned int nChainCount;
-};
-struct FoundRainbowChain
-{
-	uint64 nIndexS;
-	int nIndexE;
-	int nCheckPoint;
-	int nGuessedPos;
-};
-struct ChainCheckChain
-{
-	uint64 nIndexS;
-	int nGuessedPos;
-};
-struct IndexRow
-{
-	uint64 prefix;
-	unsigned int prefixstart, numchains;
-};
-
-typedef struct
-{
-	string sName;
-	int nPlainLenMin;
-	int nPlainLenMax;
-} tCharset;
-
-#define MAX_PLAIN_LEN 256
-#define MIN_HASH_LEN  8
-#define MAX_HASH_LEN  256
-#define MAX_SALT_LEN  256
-
-// XXX nmap is GPL2, will check newer releases regarding license
-// Code comes from nmap, used for the linux implementation of kbhit()
-#ifndef _WIN32
-#include <unistd.h>
-#include <termios.h>
-#include <fcntl.h>
-
-int tty_getchar();
-void tty_done();
-void tty_init();
-void tty_flush(void);
-// end nmap code
-
-#endif
-
-unsigned int GetFileLen(FILE* file);
-string TrimString(string s);
-bool ReadLinesFromFile(string sPathName, vector<string>& vLine);
-bool SeperateString(string s, string sSeperator, vector<string>& vPart);
-string uint64tostr(uint64 n);
-string uint64tohexstr(uint64 n);
-string HexToStr(const unsigned char* pData, int nLen);
-uint64 GetAvailPhysMemorySize();
-void ParseHash(string sHash, unsigned char* pHash, int& nHashLen);
-bool GetHybridCharsets(string sCharset, vector<tCharset>& vCharset);
-void Logo();
-
-#endif