Hi for my assignment i have to create my own greater than operator for a string class. Basically the class acts as the std string class library but i gotta edit the greater than operator in it. The assignment says upper and lower case should be treated as equal eg Joe=joe=JOE.
The reason for this is so that the sort method will sort strings regradless of their case type(upper/lower case)

#ifndef STR_H
#define STR_H

#include <algorithm>
#include <cstring>
#include <cctype>

#ifndef _MSC_VER
using std::isspace;

#include "Vec.h"

class Str {
	// input operator implemented in 12.3.2/216
	friend std::istream& operator>>(std::istream&, Str&);
	friend std::istream& getline(std::istream&, Str&);
	Str& operator+=(const Str& s) {
		std::copy(s.data.begin(), s.data.end(),
		return *this;

	// as before
	typedef Vec<char>::size_type size_type;

	Str() { }
	Str(size_type n, char c): data(n, c) { }
	Str(const char* cp) {
#ifdef _MSC_VER
		std::copy(cp, cp + strlen(cp), std::back_inserter(data));
		std::copy(cp, cp + std::strlen(cp), std::back_inserter(data));
	template <class In> Str(In i, In j) {
		std::copy(i, j, std::back_inserter(data));

	char& operator[](size_type i) { return data[i]; }
	const char& operator[](size_type i) const { return data[i]; }
	size_type size() const { return data.size(); }

	typedef char* iterator;
	typedef const char* const_iterator;

	iterator begin() { return data.begin(); }
	const_iterator begin() const { return data.begin(); }

	iterator end() { return data.end(); }
	const_iterator end() const { return data.end(); }

	Vec<char> data;

// output operator implemented in 12.3.2/216
std::ostream& operator<<(std::ostream&, const Str&);

Str operator+(const Str&, const Str&);
inline bool operator<(const Str& lhs, const Str& rhs)
       return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
inline bool operator>(const Str& lhs, const Str& rhs)
        //the character case of lhs, rhs must be treated as equal
	return std::lexicographical_compare(rhs.begin(), rhs.end(), lhs.begin(), lhs.end());
inline bool operator<=(const Str& lhs, const Str& rhs)
	return !std::lexicographical_compare(rhs.begin(), rhs.end(), lhs.begin(), lhs.end());

inline bool operator>=(const Str& lhs, const Str& rhs)
	return !std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());

inline bool operator==(const Str& lhs, const Str& rhs)
	return lhs.size() == rhs.size() &&
		std::equal(lhs.begin(), lhs.end(), rhs.begin());
inline bool operator!=(const Str& lhs, const Str& rhs)
	return !(lhs == rhs);


Recommended Answers

All 3 Replies

So what's your question?

You'll also need to #include <iterator> if you want to use those back_inserters properly.

The lexicographical_compare() algorithm optionally takes a fifth argument: a boolean predicate. You can make your custom predicate do a case-insensitive comparison by converting both arguments toupper() before returning whether a < b.

Hope this helps.

tyvm i got it working yay:)

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, learning, and sharing knowledge.