mirror of
https://github.com/dart-lang/sdk
synced 2024-11-05 18:22:09 +00:00
36a67fa046
This implements const constructor fromEnvironment on bool, int and String. The VM have the added -Dname=value option to define the value for the properties. All values are provided by using the -D - nothing is read from the environment. If the resulting value is null or - in the case of int.fromEnvironment - not a number an ArgumentError is thrown. This CL does not have any implementation for dart2js. This is a continuation of the change https://chromiumcodereview.appspot.com/24975002 by iposva@ BUG= R=iposva@google.com Review URL: https://codereview.chromium.org//50983002 git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@29642 260f80e4-7a28-3924-810f-c04153c831b5
101 lines
2.6 KiB
C++
101 lines
2.6 KiB
C++
// Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
|
|
// for details. All rights reserved. Use of this source code is governed by a
|
|
// BSD-style license that can be found in the LICENSE file.
|
|
|
|
#ifndef PLATFORM_HASHMAP_H_
|
|
#define PLATFORM_HASHMAP_H_
|
|
|
|
#include "platform/globals.h"
|
|
|
|
namespace dart {
|
|
|
|
class HashMap {
|
|
public:
|
|
typedef bool (*MatchFun) (void* key1, void* key2);
|
|
|
|
static bool SamePointerValue(void* key1, void* key2) {
|
|
return key1 == key2;
|
|
}
|
|
|
|
static uint32_t StringHash(char* key) {
|
|
uint32_t hash_ = 0;
|
|
if (key == NULL) return hash_;
|
|
int len = strlen(key);
|
|
for (int i = 0; i < len; i++) {
|
|
hash_ += key[i];
|
|
hash_ += hash_ << 10;
|
|
hash_ ^= hash_ >> 6;
|
|
}
|
|
hash_ += hash_ << 3;
|
|
hash_ ^= hash_ >> 11;
|
|
hash_ += hash_ << 15;
|
|
return hash_ == 0 ? 1 : hash_;
|
|
}
|
|
|
|
static bool SameStringValue(void* key1, void* key2) {
|
|
return strcmp(reinterpret_cast<char*>(key1),
|
|
reinterpret_cast<char*>(key2)) == 0;
|
|
}
|
|
|
|
|
|
// initial_capacity is the size of the initial hash map;
|
|
// it must be a power of 2 (and thus must not be 0).
|
|
HashMap(MatchFun match, uint32_t initial_capacity);
|
|
|
|
~HashMap();
|
|
|
|
// HashMap entries are (key, value, hash) triplets.
|
|
// Some clients may not need to use the value slot
|
|
// (e.g. implementers of sets, where the key is the value).
|
|
struct Entry {
|
|
void* key;
|
|
void* value;
|
|
uint32_t hash; // The full hash value for key.
|
|
};
|
|
|
|
// If an entry with matching key is found, Lookup()
|
|
// returns that entry. If no matching entry is found,
|
|
// but insert is set, a new entry is inserted with
|
|
// corresponding key, key hash, and NULL value.
|
|
// Otherwise, NULL is returned.
|
|
Entry* Lookup(void* key, uint32_t hash, bool insert);
|
|
|
|
// Removes the entry with matching key.
|
|
void Remove(void* key, uint32_t hash);
|
|
|
|
// Empties the hash map (occupancy() == 0).
|
|
void Clear();
|
|
|
|
// The capacity of the table. The implementation
|
|
// makes sure that occupancy is at most 80% of
|
|
// the table capacity.
|
|
intptr_t capacity() const { return capacity_; }
|
|
|
|
// Iteration
|
|
//
|
|
// for (Entry* p = map.Start(); p != NULL; p = map.Next(p)) {
|
|
// ...
|
|
// }
|
|
//
|
|
// If entries are inserted during iteration, the effect of
|
|
// calling Next() is undefined.
|
|
Entry* Start() const;
|
|
Entry* Next(Entry* p) const;
|
|
|
|
private:
|
|
MatchFun match_;
|
|
Entry* map_;
|
|
uint32_t capacity_;
|
|
uint32_t occupancy_;
|
|
|
|
Entry* map_end() const { return map_ + capacity_; }
|
|
Entry* Probe(void* key, uint32_t hash);
|
|
void Initialize(uint32_t capacity);
|
|
void Resize();
|
|
|
|
friend class IntSet; // From hashmap_test.cc
|
|
};
|
|
|
|
} // namespace dart
|
|
|
|
#endif // PLATFORM_HASHMAP_H_
|