Skip to content

Implementing Map, Set, Vector, Stack containers in c++ without the use of STL containers

Notifications You must be signed in to change notification settings

Ahaif/STL_containers

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Description

In this project, I re-implement a few container types of the C++ standard template library.

Containers

Recoding from scratch the following containers with their Methods that exist in std--98

  • Vector
  • Stack : using vector class as default underlying container. But it must still be compatible with other containers, the STL ones included.
  • Map : RedBlack Tree Implementation
  • Set : RedBlack Tree Implementation

Additional Classes:

  • iterators_traits

  • reverse_iterator

  • enable_if

  • is_integral

  • equal and/or lexicographical_compare

  • std::pair

  • std::make_pair

  • See Subject attached for more details about the projects requirments

About

Implementing Map, Set, Vector, Stack containers in c++ without the use of STL containers

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published