Advertisement
| Hall of Fame |
|
[x]
Posted via EE Mobile
|
||
Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
||
| Question |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: 56: 57: 58: 59: 60: 61: 62: 63: 64: 65: 66: 67: 68: 69: 70: 71: 72: 73: 74: 75: 76: 77: 78: 79: 80: 81: 82: 83: 84: 85: 86: 87: 88: 89: 90: 91: 92: 93: 94: 95: 96: 97: 98: 99: 100: 101: 102: 103: 104: 105: 106: 107: 108: 109: 110: 111: 112: 113: 114: 115: 116: 117: 118: 119: 120: 121: 122: 123: 124: 125: 126: 127: 128: 129: 130: 131: 132: 133: 134: 135: 136: 137: 138: 139: 140: 141: 142: 143: 144: 145: |
#include "stdafx.h"
#include <iostream>
#include <iomanip>
#include <string.h>
#include <fcntl.h>
#include <io.h>
#include "test2.h"
// build requires a link to miles32.lib
// in Vis Studio 2005, rclick on Project, Add existing item
// to bring in miles32.lib (should copy the file into the project
// directory
// by same means can Add existing item for test1.h to Header Files
// section
using namespace std;
#define NULBYT '\0'
char input[200];
char output[4000];
class String {
private:
char *ptr;
public:
String();
String(char *s);
String(const String &src);
~String();
String& operator=(const String &src)
{cpy(src.ptr); return *this;}
String& operator=(char *s)
{cpy(s); return *this;}
String operator+(char *s);
int operator==(const String &other);
operator char*() {return ptr;}
void cat(char *s);
void cpy(char *s);
};
void main(int argc, char *argv[])
{
//LOCATION_RECORD from, *pf;
//LOCATION_RECORD to, *pt;
//LOCATION_RECORD vald, *pv;
long ret_value;
//pf = &from;
//pt = &to;
//pv = &vald;
String input1, input2, input3, zip1, zip2, zip3, suffix;
zip1 = argv[1];
zip2 = argv[2];
zip3 = "06111";
suffix = " ";
input1 = zip1 + suffix;
input2 = zip2 + suffix;
input3 = zip3 + suffix;
ret_value = GetHHGDistanceValid(input1,input2);
if (ret_value == -1)
{
if (GetHHGDistanceValid (input3, input1) == -1) { printf("%s",argv[1]); }
if (GetHHGDistanceValid (input3, input2) == -1) { printf("%s",argv[2]); }
} else {
cout << ret_value;
}
ExEnd();
}
// ----------------------------------
// STRING CLASS FUNCTIONS
String::String() {
ptr = new char[1];
ptr[0] = '\0';
}
String::String(char *s) {
int n = strlen(s);
ptr = new char[n + 1];
strcpy(ptr, s);
//strcpy_s(ptr,strlen(ptr), s);
}
String::String(const String &src) {
int n = strlen(src.ptr);
ptr = new char[n + 1];
strcpy(ptr, src.ptr);
//strcpy_s(ptr,strlen(ptr),src.ptr);
}
String::~String() {
delete [] ptr;
}
int String:: operator==(const String &other) {
return (strcmp(ptr, other.ptr) == 0);
}
String String::operator+(char *s) {
String new_str(ptr);
new_str.cat(s);
return new_str;
}
// cpy -- Copy string function
//
void String::cpy(char *s) {
delete [] ptr;
int n = strlen(s);
ptr = new char[n + 1];
strcpy(ptr, s);
//strcpy_s(ptr,strlen(ptr),s);
}
// cat -- Concatenate string function
//
void String::cat(char *s) {
// Allocate sufficient room for new string data.
int n = strlen(ptr) + strlen(s);
char *p1 = new char[n + 1];
// Copy data to this new memory block.
strcpy(p1, ptr);
strcat(p1, s);
// strcpy_s(p1,strlen(p1),ptr);
//// w. strcat_s the 2nd parameter is total length of buffer
// strcat_s(p1,strlen(p1),s);
// Release old memory block and update ptr.
delete [] ptr;
ptr = p1;
}
|