World: r3wp
[Core] Discuss core issues
older newer | first last |
Anton 11-Feb-2007 [7139] | Maybe check that BLK really has the expected types in the correct order. |
Maxim 11-Feb-2007 [7140x6] | oh my... I just found it... same? :select get in system/words 'select == false |
seems some code redefines select somewhere... >:-( | |
well, thanks for bearing with me... your words vs lit-words idea... got me probing differently.. | |
strangely, I can't trace where that is happeneing... willl try to protect the word... | |
well, as usually protect doesn't help... arrgh. | |
(as usuall) | |
Anton 11-Feb-2007 [7146] | protect doesn't help ? Is SELECT redefined despite being protected ? |
Maxim 11-Feb-2007 [7147x5] | well, protect, only helps within the global context... which is why I wish there was /HARD mode which protected ANY setup of a specific word. |
probably also can protect word within a context... but at that point, the damage is usually done. | |
I've discoverd another way to discover where a set occurs... within objects, you look at the first... and the natural order of words, is a telling clue... | |
first self | |
well found it... and its a biggie :-( deep within glayout... well... its actually pretty easy for fix there, though. | |
Maxim 12-Feb-2007 [7152] | why the hell did I use select... its actually quite strange that this is the first time I've hit this snag in 3 years though ! |
Anton 12-Feb-2007 [7153x2] | I should just point out that only the system/words object can grow dynamically. |
Other objects have fixed order of words. | |
Maxim 12-Feb-2007 [7155] | the issue is that as it is a commonly used feature, although easy to fix within glayout... many references to in my apps will break... ahh... |
Anton 12-Feb-2007 [7156] | The order does not change after the initial SET. |
Maxim 12-Feb-2007 [7157] | yes. |
Anton 12-Feb-2007 [7158] | >> set 'var-1 1 == 1 >> set 'var-2 2 == 2 >> set 'var-1 3 == 3 >> print mold skip tail first system/words -4 [Comments in-obj var-1 var-2] |
Maxim 12-Feb-2007 [7159x4] | how the hell did I not realise I was overiding such a core word? sometimes the obvious just slips by... when you're looking the other way ' :-/ |
yes anton, which is why I discovered where it was being set... after a func called 'layout (this one voluntarily being an override) | |
It would be nice in R3 if we could remove things from an object when deriving with make... (we can , sort of, using the 'THIRD accessor on an object and editing it....) | |
but when the object is being created by another controler (like in view) then we can't really... | |
PeterWood 12-Feb-2007 [7163] | So you'd really like Rebol to have the equivalent of JavaScript's Delete operator? |
Maxim 12-Feb-2007 [7164x2] | hum don't know about it... but if I could do obj: make/without ref-obj [] [select] We could already shrink our objects, when its needed. |
binding would then have to replace any object-local bindings of select to the global context and raise an error if it doesn't exist, as it would if you had tried to define a new object with select undefined in any place. | |
PeterWood 12-Feb-2007 [7166x2] | One think that I like in JavaScript is the flexibility to freely add and remove members from object instances and object prototypes . |
think -> thing | |
Maxim 12-Feb-2007 [7168x2] | it is usefull only when it is something which is not automatic like in python, where its nightmarish. |
if you inadvertently typo , then you create a new member! talk about hard to debug errors!! | |
Joe 13-Feb-2007 [7170] | how does the path native work ? I couldn't find it in the rebol dictionary |
BrianH 13-Feb-2007 [7171] | Joe, that native is an accidently exposed internal function. It has no use externally. |
Henrik 14-Feb-2007 [7172] | If I'm calling a function with many different refinements and the function has to work recursively and all refinements must be maintained throughout recursion, is there an easy way to get the function call with all refinements? I'm using: >> f: func [/a /b] [to-path remove-each p reduce ['f all [a 'a] all [b 'b]] [none? p]] >> f == f >> f/a == f/a >> f/b/a == f/a/b ; lose refinement order |
Anton 14-Feb-2007 [7173x4] | I'm not sure if this helps but I sometimes make a wrapper function which calls the actual recursive function. The wrapper could take the refinements and set some flags in a context shared by all calls to the inner recursion function. |
Oh hang on, your question indicates that your example code above is currently working, but you are looking for a better way. Is that correct ? | |
A "how was this function called ?" function. I don't think there is a way. (although in recent discussion on BIND?....) | |
ooh.. actually.... | |
Henrik 14-Feb-2007 [7177] | 1. it currently works but is clumsy, I think 2. "how was this function called ?" = yes |
Anton 14-Feb-2007 [7178] | How about this: >> f: func [/a /b][print mold second bind? 'a] >> f/a/b [true true] :) |
Henrik 14-Feb-2007 [7179x2] | there is something about that you don't know the actual function name inside the function? if only the refinements and their order could be managed. |
testing... | |
Anton 14-Feb-2007 [7181x2] | That's right, since several words can refer to the same function, it has no "one" word. |
(it also could be an anonymous function) | |
Henrik 14-Feb-2007 [7183] | well, that only brings up a block and the refinement order is still off, which would be a problem if your refinements have arguments |
Anton 14-Feb-2007 [7184x2] | I see. |
I think you must pass in the code which is used to launch the function as a function argument :) | |
Henrik 14-Feb-2007 [7186] | nasty! |
Anton 14-Feb-2007 [7187] | yep :) |
Henrik 14-Feb-2007 [7188] | I wonder how hard this would be to implement in a single function. Probably very hard if functions internally are unaware of refinement order |
older newer | first last |