events.action: opened
events.author: samchon
events.masked_author: username_0
events.text: case 1. Add a new type definition.
  - [v] checked compilation succeeds with `--target es6` and `--noImplicitAny` options.
  - [v] has correct [naming convention](http://definitelytyped.org/guides/contributing.html#naming-the-file)
  - [v] has a [test file](http://definitelytyped.org/guides/contributing.html#tests) with the suffix of  `-tests.ts` or `-tests.tsx`.
  ===========
  ## Finally, TypeScript-STL v1.0 has released.
  ##### Release Candidate
  Now, release candidate has begun. If you find some bugs or something to improve, please write to the [**issues**](https://github.com/username_0/stl/issues).
  
  ##### References
  You can learn about the TypeScript-STL more deeply with API Documents and Wiki.
    - [API Documents](http://username_0.github.io/stl/api)
    - [Wiki](https://github.com/username_0/stl/wiki)
  
  ##### Implementeds
  ###### Containers
  - [Linear containers](http://username_0.github.io/stl/api/interfaces/std.base.container.ilinearcontainer.html)
      - [Vector](http://username_0.github.io/stl/api/classes/std.vector.html)
      - [List](http://username_0.github.io/stl/api/classes/std.list.html)
      - [Deque](http://username_0.github.io/stl/api/classes/std.deque.html)
  - [Tree-structured containers](http://username_0.github.io/stl/api/classes/std.base.tree.rbtree.html)
      - [TreeSet](http://username_0.github.io/stl/api/classes/std.treeset.html)
      - [TreeMap](http://username_0.github.io/stl/api/classes/std.treemap.html)
      - [TreeMultiSet](http://username_0.github.io/stl/api/classes/std.treemultiset.html)
      - [TreeMultiMap](http://username_0.github.io/stl/api/classes/std.treemultimap.html)
  - [Hashed containers](http://username_0.github.io/stl/api/classes/std.base.hash.hashbuckets.html)
      - [HashSet](http://username_0.github.io/stl/api/classes/std.hashset.html)
      - [HashMap](http://username_0.github.io/stl/api/classes/std.hashmap.html)
      - [HashMultiSet](http://username_0.github.io/stl/api/classes/std.hashmultiset.html)
      - [HashMultiMap](http://username_0.github.io/stl/api/classes/std.hashmultimap.html)
  - Etc.
      - [Queue](http://username_0.github.io/stl/api/classes/std.queue.html)
      - [Stack](http://username_0.github.io/stl/api/classes/std.stack.html)
      - [PriorityQueue](http://username_0.github.io/stl/api/classes/std.priorityqueue.html)
  
  ###### Exceptions
  All type of exceptions
  
  ###### Global Functions
    - &lt;algorithm&gt;
      - All the functions in &lt;algorithm&gt;
    - &lt;functional&gt;
      - [std.bind](http://username_0.github.io/stl/api/modules/std.html#bind)
      - [std.placeholders](http://username_0.github.io/stl/api/modules/std.placeholders.html)
      - [std.hash](http://username_0.github.io/stl/api/modules/std.html#hash)
    - &lt;utility&gt;
      - [std.Pair](http://username_0.github.io/stl/api/classes/std.pair.html)
  
  ## Updated from v0.9.7
  ##### API Documents are strengthen with Class Diagrams
  Now, you can see the related class diagrams in *API Documents*'s each page.
  
  ![Abstract Containers](http://username_0.github.io/stl/api/assets/images/design/abstract_containers.png "Abstract Containers")
  
  ##### Hash and Tree containers are refactored
  Ordinary maps (also sets) are inherited from base.UniqueMap or base.MultiMap by uniqueness of key. Now, the map containers also implement base.ITreeMap or base.IHasMap by their key-mapping algorithm.
  
    - [ITreeMap](http://username_0.github.io/stl/api/interfaces/std.base.itreemap.html)
    - [IHashMap](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html)
  
  ##### Hash buckets function in Hash containers are implemented
  Now, you also can access to hash buckets following those member functions.
  
    - [begin](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#begin)
    - [end](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#end)
    - [bucket_count](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#bucket_count)
    - [bucket_size](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#bucket_size)
    - [max_load_factor](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#max_load_factor)
    - [bucket](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#bucket)
    - [reserve](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#reserve)
    - [rehash](http://username_0.github.io/stl/api/interfaces/std.base.ihashmap.html#rehash)
  
  ##### Heap functions are implemented
  Global heap functions in **&lt;algorithm&gt;** are implemented.
  
    - [std.make_heap](http://username_0.github.io/stl/api/modules/std.html#make_heap)
    - [std.push_heap](http://username_0.github.io/stl/api/modules/std.html#push_heap)
    - [std.pop_heap](http://username_0.github.io/stl/api/modules/std.html#pop_heap)
    - [std.is_heap](http://username_0.github.io/stl/api/modules/std.html#is_heap)
    - [std.is_heap_until](http://username_0.github.io/stl/api/modules/std.html#is_heap_until)
    - [std.sort_heap](http://username_0.github.io/stl/api/modules/std.html#sort_heap)
events.title: TypeScript-STL v1.0.0-rc.1
events.type: issue
events.action: created
events.author: samchon
events.masked_author: username_0
events.text: Wrong commit
events.type: comment