cocoa - KVO's add & remove observer methods – counted or idempotent? -


in kvo subscribe receive change notifications potential sender with:

[potentialsender addobserver: self                    forkeypath: nsstringfromselector(@selector(aproperty))                      options: 0                      context: mykvohandle];

and can unsubscribe with:

[potentialsender removeobserver: self                      forkeypath: nsstringfromselector(@selector(aproperty))                         context: mykvohandle];

where kvo handles might created this c idiom.

are calls these counted – every add must directly paired , precede remove – pre-arc retain , release?

alternatively, idempotent – number of add calls can stopped single remove, several remove operations without matching add safe?

i believe idempotent approach used [acontrol addtarget:action:forcontrolevents:] and [anotificationcentre addobserver:selector:name:object:]. wrong notification centre addobserver calls. not idempotent. however, removes are. rob correcting me on this.

kvo calls must balanced. every addobserver:... must balanced equivalent removeobserver:.... , there no mechanism "unsubscribe all" there nsnotificationcenter. remove not balance add error. kvo picky.

note nsnotificationcenter absolutely not idempotent. multiple, identical addobserver:... calls result in multiple notifications. it's possible global removeobserver:self without balancing every addobserver:..., , safe remove when have not added.


-

Popular posts from this blog

debugging - Reference - What does this error mean in PHP? -

what this? this number of answers warnings, errors , notices might encounter while programming php , have no clue how fix. community wiki, invited participate in adding , maintaining list. why this? questions "headers sent" or "calling member of non-object" pop on stack overflow. root cause of questions same. answers questions typically repeat them , show op line change in his/her particular case. these answers not add value site because apply op's particular code. other users having same error can not read solution out of because localized. sad, because once understood root cause, fixing error trivial. hence, list tries explain solution in general way apply. what should here? if question has been marked duplicate of this, please find error message below , apply fix code. answers contain further links investigate in case shouldn't clear general answer alone. if want contribute, please add "favorite" error message, warning or notic...
Read more

c++ - Why doesn't unordered_set provide an array access operator -

i'm curious why stl container unordered_set , has constant time complexity random access on average, not provide method accessing elements distance first element in container. example: t& unordered_set::operator[](size_t index) { return *(begin() + index); } accessing element "by distance" implies there meaningful way measure distance. trouble std::unordered_set is is, well, unordered . hence, there no meaningful way of explaining "some distance beginning" in non-arbitrary way. if want access distance, copy data vector: std::vector tmp(unordered.begin(), unordered.end());
Read more