fUsers
UserList fUsers;
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();)
fUsers(new(std::nothrow) UserMap),
fUsers(new(std::nothrow) UserMap),
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
delete fUsers;
int32 userCount = fUsers->Size();
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
if (!fUsers || !fShares || !fPermissions || !fNode2Path || !fPath2Node)
if (fUsers->InitCheck() != B_OK)
return fUsers->InitCheck();
if (fUsers->Get(name))
error = fUsers->Put(name, user);
if (fUsers->Get(user->GetName()) != user)
fUsers->Remove(user->GetName());
User* user = fUsers->Get(name);
return fUsers->Size();
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();) {
if (fUsers->Get(user->GetName()) != user)
if (fUsers->Get(user->GetName()) != user)
for (UserMap::Iterator it = fUsers->GetIterator(); it.HasNext();)
UserMap* fUsers;
return fUsers.InitCheck();
if (fUsers.ContainsKey(user))
count = fUsers.Get(user);
fUsers.Put(user, count);
if (!fUsers.ContainsKey(user))
int32 count = fUsers.Get(user);
fUsers.Put(user, count);
fUsers.Remove(user);
for (UserCountMap::Iterator it = fUsers.GetIterator(); it.HasNext();) {
UserCountMap fUsers;
fUsers.MakeEmpty();
|| (error = _AddUsers(archive, "users", fUsers)) != B_OK
.Write("users", fUsers)
fUsers(4),
fUsers(4),
&& (error = _ExtractUsers(archive, "users", fUsers)) == B_OK
int32 userCount = fUsers.CountItems();
const BUser* user = fUsers.ItemAt(i);
return fUsers;
fUsers.MakeEmpty();
if (newUser == NULL || !fUsers.AddItem(newUser)) {
_ParseUsers(&packageInfo->fUsers);