84     pub fn delete_ids_for_user(&mut self, user_id: i32) -> Result<()> {  in delete_ids_for_user()
89     pub fn delete_ids_for_app(&mut self, user_id: i32, app_id: i32) -> Result<()> {  in delete_ids_for_app()  argument
138         let user_id: i32 = user_id.try_into().context(format!("user_id {user_id} out of range"))?;  in add_id()
139         let app_id: i32 = app_id.try_into().context(format!("app_id {app_id} out of range"))?;  in add_id()
171     fn delete_ids_for_user(&mut self, user_id: i32) -> Result<()> {  in delete_ids_for_user()
181     fn delete_ids_for_app(&mut self, user_id: i32, app_id: i32) -> Result<()> {  in delete_ids_for_app()  argument
226         let mut users: Vec<i32> = owners.iter().map(|(u, _a)| *u).collect();  in reconcile()
240                 let mut apps: Vec<i32> = owners  in reconcile()
259                 let missing_apps: Vec<i32> = apps  in reconcile()
288 fn core_app_id(app_id: i32) -> bool {  in core_app_id()
360         gone_users: Vec<i32>,
361         gone_apps: Vec<i32>,
365         fn doUsersExist(&self, user_ids: &[i32]) -> binder::Result<Vec<bool>> {  in doUsersExist()
368         fn doAppsExist(&self, _user_id: i32, app_ids: &[i32]) -> binder::Result<Vec<bool>> {  in doAppsExist()  argument
380     const USER1: i32 = 1;
381     const USER2: i32 = 2;
382     const USER3: i32 = 3;
383     const APP_A: i32 = 10050;
384     const APP_B: i32 = 10060;
385     const APP_C: i32 = 10070;
386     const CORE_APP_A: i32 = 45;
547         fn doUsersExist(&self, user_ids: &[i32]) -> binder::Result<Vec<bool>> {  in doUsersExist()
550         fn doAppsExist(&self, user_id: i32, app_ids: &[i32]) -> binder::Result<Vec<bool>> {  in doAppsExist()  argument