/* Function: tp_has * Checks if an object contains a key. * * Returns tp_True if self[k] exists, tp_False otherwise. */ tp_obj tp_has(TP,tp_obj self, tp_obj k) { int type = self.type; if (type == TP_DICT) { if (_tp_dict_find(tp,self.dict.val,k) != -1) { return tp_True; } return tp_False; } else if (type == TP_STRING && k.type == TP_STRING) { return tp_number(_tp_str_index(self,k)!=-1); } else if (type == TP_LIST) { return tp_number(_tp_list_find(tp,self.list.val,k)!=-1); } tp_raise(tp_None,tp_string("(tp_has) TypeError: iterable argument required")); }
/* Function: tp_iget * Failsafe attribute lookup. * * This is like <tp_get>, except it will return false if the attribute lookup * failed. Otherwise, it will return true, and the object will be returned * over the reference parameter r. */ int tp_iget(TP,tp_obj *r, tp_obj self, tp_obj k) { if (self.type == TP_DICT) { int n = _tp_dict_find(tp,self.dict.val,k); if (n == -1) { return 0; } *r = self.dict.val->items[n].val; tp_grey(tp,*r); return 1; } if (self.type == TP_LIST && !self.list.val->len) { return 0; } *r = tp_get(tp,self,k); tp_grey(tp,*r); return 1; }
tp_obj tp_has(tp_vm *tp, tp_obj self, tp_obj k) { int type = obj_type(self); if (type == TP_DICT) { if (_tp_dict_find(tp, tp_dict_val(self), k) != -1) { return True; } return False; } else if (type == TP_STRING && obj_type(k) == TP_STRING) { char *p = strstr(STR(self),STR(k)); return tp_number(tp, p != 0); } else if (type == TP_LIST) { return tp_number(tp, _tp_list_find(tp,tp_list_val(self),k)!=-1); } tp_raise(None,"tp_has(%s,%s)",STR(self),STR(k)); }
int tp_iget(TP,tp_obj *r, tp_obj self, tp_obj k) { if (obj_type(self) == TP_DICT) { int n = _tp_dict_find(tp, tp_dict_val(self),k); if (n == -1) { return 0; } *r = tp_dict_val(self)->items[n].val; tp_grey(tp,*r); return 1; } if (obj_type(self) == TP_LIST && !tp_list_val(self)->len) { return 0; } *r = tp_get(tp,self,k); tp_grey(tp,*r); return 1; }
tp_obj tp_has(TP,tp_obj self, tp_obj k) { int type = self.type; if (type == TP_DICT) { if (_tp_dict_find(tp,self.dict.val,k) != -1) { return tp_True; } return tp_False; } else if (type == TP_STRING && k.type == TP_STRING) { char *p = strstr(TP_CSTR(self),TP_CSTR(k)); return tp_number(p != 0); } else if (type == TP_LIST) { return tp_number(_tp_list_find(tp,self.list.val,k)!=-1); } tp_raise(tp_None,"tp_has(%s,%s)",TP_CSTR(self),TP_CSTR(k)); }
tp_obj tp_track(TP,tp_obj v) { if (v.type == TP_STRING) { int i = _tp_dict_find(tp,tp->strings,v); if (i != -1) { tp_delete(tp,v); v = tp->strings->items[i].key; tp_grey(tp,v); return v; } _tp_dict_setx(tp,tp->strings,v,tp_True); } tp_gcinc(tp); tp_grey(tp,v); return v; }
int _tp_lookup_(TP,tp_obj self, tp_obj k, tp_obj *meta, int depth) { int n = _tp_dict_find(tp,self.dict.val,k); if (n != -1) { *meta = self.dict.val->items[n].val; return 1; } depth--; if (!depth) { tp_raise(0,tp_string("(tp_lookup) RuntimeError: maximum lookup depth exceeded")); } if (self.dict.dtype && self.dict.val->meta.type == TP_DICT && _tp_lookup_(tp,self.dict.val->meta,k,meta,depth)) { if (self.dict.dtype == 2 && meta->type == TP_FNC) { *meta = tp_fnc_new(tp,meta->fnc.ftype|2, meta->fnc.cfnc,meta->fnc.info->code, self,meta->fnc.info->globals); } return 1; } return 0; }