Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Remove code that is no longer needed #662

Merged
merged 1 commit into from
Jan 16, 2017
Merged

Remove code that is no longer needed #662

merged 1 commit into from
Jan 16, 2017

Conversation

amitdo
Copy link
Collaborator

@amitdo amitdo commented Jan 16, 2017

The code in ccutil/hashfn.h was needed for some old compilers. Now that we support MSVC >= 2010 and compilers that have good support for C++11, we can drop this code.

As a result of this file removal, we now use:
std::unordered_map
std::unordered_set
std::unique_ptr
directly in the codebase with '#include' for the needed headers.

The code in ccutil/hashfn.h was needed for some old compilers. Now that we support MSVC >= 2010 and compilers that has good support for C++11, we can drop this code.

As a result of this file removal, we now use:
  std::unordered_map
  std::unordered_set
  std::unique_ptr
directly in the codebase with '#include' for the needed headers.
Copy link
Member

@stweil stweil left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Maybe you can order the system include statements in alphabetic order.

@zdenop zdenop merged commit 170573f into tesseract-ocr:master Jan 16, 2017
@amitdo amitdo deleted the remove-hashfn2 branch January 16, 2017 10:22
@amitdo
Copy link
Collaborator Author

amitdo commented Jan 16, 2017

Maybe you can order the system include statements in alphabetic order.

You can send a new PR :-)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants