coffee/better-enums
1
0
Fork 0
mirror of https://github.com/aantron/better-enums.git synced 2025-12-06 16:56:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added contact information to README.

Browse Source
This commit is contained in:
Anton Bachin 2015-05-14 07:39:22 -05:00
parent dd606fd450
commit e7a093709f
2 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
README.md
View File

@ -26,7 +26,7 @@ tutorial.
Simply add `enum.h` and `enum_preprocessor_map.h` to your project. The current Simply add `enum.h` and `enum_preprocessor_map.h` to your project. The current
version can be found at version can be found at
[https://github.com/aantron/better-enums](https://github.com/aantron/better-enums). [https://github.com/aantron/better-enums/releases](https://github.com/aantron/better-enums/releases).
`enum_preprocessor_map.h` can handle enums with up to 256 constants. If you have `enum_preprocessor_map.h` can handle enums with up to 256 constants. If you have
more, re-generate it by running something like: more, re-generate it by running something like:
@ -68,6 +68,11 @@ to lagging C++11 support in msvc. It should ultimately be portable to msvc,
since msvc has its own version of weak symbols. Everything else in the library since msvc has its own version of weak symbols. Everything else in the library
is standard C++. is standard C++.
## Contact
Don't hesitate to contact me about features (or bugs!):
<a href="mailto:antonbachin@yahoo.com">antonbachin@yahoo.com</a>
## Explanation ## Explanation
The `ENUM` macro specializes a template based around a regular `enum` The `ENUM` macro specializes a template based around a regular `enum`

3
doc/index.html
View File

@ -925,9 +925,6 @@ for (var index = 0; index < property_headers.length; ++index) {
var header = property_headers[index]; var header = property_headers[index];
var next = header.nextSibling; var next = header.nextSibling;
console.log(header);
console.log(header.parentNode);
if (next === null) if (next === null)
header.parentNode.appendChild(br); header.parentNode.appendChild(br);
else else