kimhxsong / hxtl Goto Github PK
View Code? Open in Web Editor NEWReimplementation of the STL containers (C++98 compatible)
hxtl's People
Contributors
Watchers
hxtl's Issues
<vector>
<Iterator> implementation
- iterator_traits
- reverse_iterator
<map>
Fix containers
TEST RESULT:
# ****************************************************************************** #
# #
# ::: ::: ::: #
# :+:+: :+:+: :+: :+: #
# +:+ +:+:+ +:+ +:+ #
# +#+ +:+ +#+ +#+ +#+ #
# +#+ +#+ +#+ #+# #
# #+# #+# #+# #+# #
# ### ### ### ### containers_test #
# #
# ****************************************************************************** #
vector
vector/assign.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/at.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/at_const.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/bidirect_it.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/copy_construct.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/erase.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
vector/insert.cpp : COMPILE: ✅ | RET: ✅ | OUT: ❌ | STD: [Y]
vector/insert2.cpp : COMPILE: ✅ | RET: ✅ | OUT: ❌ | STD: [Y]
vector/ite.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/ite_arrow.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
vector/ite_eq_ope.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
vector/ite_n0.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [N]
vector/ite_n00.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [N]
vector/ite_n1.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [N]
vector/push_pop.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/relational_ope.cpp : COMPILE: ✅ | RET: ✅ | OUT: ❌ | STD: [Y]
vector/rev_ite_construct.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/rite.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/rite2.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
vector/rite_arrow.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
vector/rite_eq_ope.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
vector/size.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
vector/swap.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
map
map/bounds.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/comp.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/copy_construct.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/empty.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/erase.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/erase2.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/find_count.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/insert.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/insert2.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/ite_arrow.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/ite_n0.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [N]
map/ite_n1.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [N]
map/ite_type.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [N]
map/more.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/op_sqbr.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/relational_ope.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/rev_ite_construct.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/rite.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/rite_arrow.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/swap.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/tricky_construct.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
map/tricky_erase.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
stack
stack/default.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
stack/default_copy.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
stack/list_copy.cpp : COMPILE: ✅ | RET: ✅ | OUT: ✅ | STD: [Y]
stack/relational_ope.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
stack/relational_ope_list.cpp : COMPILE: ❌ | RET: ❌ | OUT: ❌ | STD: [Y]
Setting up the development environment
<algorithm> implementation
- std::equal
- std::lexicographical_compare
Reimplement <map>
Todo
- __tree.hpp .tpp
- __tree_iterator.hpp .tpp
- __tree_iterator_unittest.cpp
- __map.hpp .tpp
- __map_iterator.hpp .tpp
<type_traits> implementation
- enable_if
- is_integral
Add unittests for enable_if, is_integral in <type_traits> header
Todo
- __is_integral_unittest.cpp
- __enable_if_unittest.cpp
Add unittests for ft::iterator_traits and ft::reverse_iterator in <iterator>
Todo
- __iterator_traits_unittest.cpp
- __reverse_iterator_unittest.cpp
Add unittests for ft::equal and ft::lexicographical_compare in <algorithm> header
Todo
- __equal_unittest.cpp
- __lexicographical_compare_unittest.cpp
Apply AVL Tree to ft::map
Create a project plan
Create a rough project outline and document the progress sequence
<utility> implementation
- std::pair
- std::make_pair
Add vector_unittest.cpp
Todo
- vector_unittest.cpp
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.