// Bernstein's hash function
unsigned int hash = 5381;
for (char c : full_author_string)
- hash = ((hash << 5) + hash) + unsigned(c);
+ hash = ((hash << 5) + hash) + (unsigned int)c;
return int(hash);
}
{}
-size_t AuthorList::record(Author const & a)
+int AuthorList::record(Author const & a)
{
bool const valid = a.valid();
// If we record an author which equals the current
Authors::const_iterator const end = authors_.end();
for (; it != end; ++it) {
if (valid && *it == a)
- return size_t(it - beg);
+ return it - beg;
if (it->bufferId() == a.bufferId()) {
- size_t const id = size_t(it - beg);
+ int const id = it - beg;
if (!it->valid()) {
// we need to handle the case of a valid author being registered
// after an invalid one. For instance, because "buffer-reload"
}
-void AuthorList::record(size_t id, Author const & a)
+void AuthorList::record(int id, Author const & a)
{
- LBUFERR(id < authors_.size());
+ LBUFERR(unsigned(id) < authors_.size());
authors_[id] = a;
}
}
-Author const & AuthorList::get(size_t id) const
+Author const & AuthorList::get(int id) const
{
- LASSERT(id < authors_.size() , return authors_[0]);
+ LASSERT(id < (int)authors_.size() , return authors_[0]);
return authors_[id];
}