diff options
author | Josh Haberman <jhaberman@gmail.com> | 2015-07-07 18:46:14 -0700 |
---|---|---|
committer | Josh Haberman <jhaberman@gmail.com> | 2015-07-07 18:46:14 -0700 |
commit | 49dab06e03c16691c4dab1ba012fe8488089a590 (patch) | |
tree | 209f0749cbba6db8c9f0bf1094e6b5b5cd5190a0 /upb/table.int.h | |
parent | 6d9a9c727fd966acec7340aeabd5bf4039c6d929 (diff) |
Brought into compliance with Google open-source policies.
- removed myself from Author headers in source files.
- removed copyright notices from source file headers.
- added CONTRIBUTING.md
Diffstat (limited to 'upb/table.int.h')
-rw-r--r-- | upb/table.int.h | 37 |
1 files changed, 17 insertions, 20 deletions
diff --git a/upb/table.int.h b/upb/table.int.h index 28e2cff..4874e3c 100644 --- a/upb/table.int.h +++ b/upb/table.int.h @@ -1,24 +1,21 @@ /* - * upb - a minimalist implementation of protocol buffers. - * - * Copyright (c) 2009 Google Inc. See LICENSE for details. - * Author: Josh Haberman <jhaberman@gmail.com> - * - * This header is INTERNAL-ONLY! Its interfaces are not public or stable! - * This file defines very fast int->upb_value (inttable) and string->upb_value - * (strtable) hash tables. - * - * The table uses chained scatter with Brent's variation (inspired by the Lua - * implementation of hash tables). The hash function for strings is Austin - * Appleby's "MurmurHash." - * - * The inttable uses uintptr_t as its key, which guarantees it can be used to - * store pointers or integers of at least 32 bits (upb isn't really useful on - * systems where sizeof(void*) < 4). - * - * The table must be homogenous (all values of the same type). In debug - * mode, we check this on insert and lookup. - */ +** upb_table +** +** This header is INTERNAL-ONLY! Its interfaces are not public or stable! +** This file defines very fast int->upb_value (inttable) and string->upb_value +** (strtable) hash tables. +** +** The table uses chained scatter with Brent's variation (inspired by the Lua +** implementation of hash tables). The hash function for strings is Austin +** Appleby's "MurmurHash." +** +** The inttable uses uintptr_t as its key, which guarantees it can be used to +** store pointers or integers of at least 32 bits (upb isn't really useful on +** systems where sizeof(void*) < 4). +** +** The table must be homogenous (all values of the same type). In debug +** mode, we check this on insert and lookup. +*/ #ifndef UPB_TABLE_H_ #define UPB_TABLE_H_ |