World: r3wp
[Core] Discuss core issues
older newer | first last |
james_nak 1-Feb-2012 [2753] | Graham, gotta love that Win 7. I was about to move all my belongings to a W7 machine and retire my XP but not now. |
SWhite 2-Feb-2012 [2754] | GrahamC, thank you for passing this around. I did get part way to a solution, as noted on your site. Strange as it may seem, I am able to get to the network drives if I run a copy of REBOL that I download and leave with the name it came with, namely rebol-view-278-3-1. The copy of REBOL that was giving me trouble was the same rebol-view-278-3-1, but I had renamed it to rebview to make a desktop shortcut work. I had the name "rebview" in the shortcut so that I would not have to change the shortcut if I ever got an upgraded version of REBOL with a different name, like maybe rebol-view-279. So my first problem with WIndows 7, REBOL, and network drives seems fixed. I still am not to a full solution to my Windows 7 issues. I have some REBOL scripts that use the "call" command to run powershell. Powershell then runs a powershell script to extract stuff from an EXCEL spreadsheet, which then is manipulated by the REBOL script. Actually it's a bit messier. I run a REBOL program launcher on the C drive which runs a REBOL script on a network drive. The script on the network drive calls powershell with parameters to make powershell run a powershell script. The powershell script extracts EXCEL data, and the calling REBOL script then makes a report of the extracted data. When I try to do this, the result from powershell is that I am not allowed to run scripts on that computer. I am aware of this feature of powershell, and I have done what has worked for Windows XP (set-executionpolicy remotesigned). I can run powershell directly, and execute scripts located on a network drive. When a REBOL script that worked on XP calls powershell on WIndows 7, it won't go. I am not expecting any help with this last issue at this time because the "call" does work in some cases (call/shell "notepad") (call/console/show "powershell"), so I still have several things to try, and if none work I am plotting a work-around. |
Endo 2-Feb-2012 [2755] | Also try to use the full path. Once I have faced a problem CALL with REBOL style file! value. It worked with a windows-style path. And also have problem with /shell worked on my XP but did not on my customers W7. |
Pekr 2-Feb-2012 [2756x2] | I just tried: do to-rebol-file "L:\some\path\here\test.r" and everything went OK, Win Vista here. Console is being launched form the shortcut on start bar, pointing to renamed to rebol.exe |
note: the reason I used to-rebol-path was, that directory names contained spaces .... | |
GrahamC 2-Feb-2012 [2758] | Ok, I'll suggest this .. |
Endo 2-Feb-2012 [2759] | When I use FIND with CHARSETs it ignores the /TAIL refinement. Is this a bug? ;with charset >> find/tail "abc" charset "b" == "bc" >> find "abc" charset "b" == "bc" ;with string >> find "abc" "b" == "bc" >> find/tail "abc" "b" == "c" |
Gregg 2-Feb-2012 [2760] | I think /last and /tail only apply to string values. Perhaps a feature that hasn't come to pass yet? :-) |
sqlab 2-Feb-2012 [2761] | be aware, that find with charsets behaves differently in more ways >> find "abc" charset "db" == "bc" |
Geomol 3-Feb-2012 [2762] | Combination of find/tail and charset looks like a bug to me. |
Maxim 3-Feb-2012 [2763x2] | sqlab, a charset is not a string its a bitset, so it will search for ALL the characters in the charset at each byte... also note that when using find, charsets are case sensitive (and very fast). the bug with /tail is pretty surprising, I never noticed it. |
sorry for the color... It got stuck, I didn't realize I was in yellow ;-) | |
sqlab 3-Feb-2012 [2765] | I know that charsets find the first occurance of any of the chars, but maybe Endo knows that too. So I should probably not remind. |
Endo 3-Feb-2012 [2766] | Thank you guys. I know the behaviour of charset in FIND. But I expect to skip the char that found, if I use /TAIL refinement as in using string. Same for /LAST as Gregg said. It ignored for charsets. And also; >> find/reverse "endo" charset "d" == none a bit confusing.. |
Gregg 3-Feb-2012 [2767] | Only Carl can say if it's by design or not. |
james_nak 3-Feb-2012 [2768x5] | I've got a function that doesn't and I know one of you can explain why. foo: func [ /dothis anobject ] [ if dothis [ dosomething anobject ] ] foo myobject So the dosomething function does not work with the "anobject". However, If I hardcode the "myobject" into foo like: foo: func [ /dothis ] [ if dothis [ dosomething myobject ] ] It works. So my questions are: Is it because "anobject" is a pointer? And what do I do on the calling/receiving sides to fix that? Thanks in advance. |
=doesn't work. | |
Hold on. I think I might be testing the wrong thing. | |
Nope, that wasn't it and I'm back to wondering what's the difference between the object and the passed object. | |
OK, figured it out. I had to pass the object as a 'word then "do" it in the function to get it to work. | |
GrahamC 3-Feb-2012 [2773] | You can pass functions as parameters, and then omit the 'do |
Gregg 3-Feb-2012 [2774] | In your example, you didn't spec the /do-this refinement on the call. Probably just a glitch in posting here though. |
james_nak 3-Feb-2012 [2775] | Thanks Graham and Gregg. The object that I was passing was a face and I tried different ways to get it to work and that was the only way it would work. I guess the question is how does one know when he is passing some value if the receiving function sees it as the writer is intending it to be seen. Anyway for now I am satisfied and have moved on to other issues. I appreciate your input though. |
Gregg 3-Feb-2012 [2776] | If the func doesn't take a lit-word/get-word argument, it should evaluate and pass as an object. Now, if you have a block of words that refer to list faces, and you pass that word, that's what you get. If your func has types defined for the args, that can help catch issues like this. |
james_nak 3-Feb-2012 [2777] | Gregg, thanks, it could be the func that's getting the arg, the "dosomething" in my example. I hadn't look at that though I was wondering still what the difference was with the two objects. Unfortunately it always seemed right even with the types defined because they were both objects. At least that's what type? outputted. Maybe it has something to do with the context they were bound to. Anyway, that's for another day. Thank you as always. |
Maxim 7-Feb-2012 [2778x2] | James, I think you are mixing up the word which refers to an object with an object value. this is confusing in Rebol because words are not variables. it's happened to me a few times (especially in VID) that I mix this up in action blocks and VID dialect builders. |
often, I'd build a block to be used and forget to reduce the block before appending it to the spec. so what happens is that you receive an unbound word, instead of the data you assumed it should be refering to. | |
james_nak 7-Feb-2012 [2780] | Thanks Maxim. |
Maxim 7-Feb-2012 [2781] | since I've been doing parse compilers for the last 2 months, I can say this have happened even more often lately ;-) you might also look up the 'COMPOSE word, it's very handy for resolving these kinds of issues (considering it's this kid of issue to begin with ;-) |
james_nak 7-Feb-2012 [2782] | Thanks. I wish there was a way to compare words like this so one could find out what the difference was. I suppose that is part of the bindology world. Glad to hear you are working with Rebol. It could be me but I haven't seen you around lately. Probably me because I haven't been around much here myself. |
Maxim 7-Feb-2012 [2783x4] | I've been working a lot lately, and haven't had a lot of spare time. I'm actually working with REBOL full time at a company which is using it to get a significant competitive advantage over the competition. |
(eek that was redundant, sorry ;-) | |
I think people don't realize just how much power lies in parse. Even I'm impressed with it right now. I've been doing tests with really crazy stuff like two-cursor parse rules and run-time auto-recompilation of 400MB parse rules. I've been doing things like parsing 100MB word documents and pushing the interpreter to the limit ... reaching the 32-bit 1.6 GB RAM limit, 6 hour loop tests, etc. :-) | |
in my last test I was doing natural language extraction of concepts at a rate of 25000 words a second within multi-megabyte text files. :-) | |
GrahamC 8-Feb-2012 [2787] | Who is this guy? |
Maxim 8-Feb-2012 [2788] | hum... either that was sarcasm or you mean, what is the company I now work for? |
GrahamC 8-Feb-2012 [2789] | Not sarcasm .. just humor :) |
Maxim 8-Feb-2012 [2790] | hehe, I wasn't sure ;-) |
james_nak 8-Feb-2012 [2791] | That's incredible Maxim. Good work. With what you do with parse, is the knowledge available online in tthe form of the present parse documentation, or did you have to discover new techniques? I have to admit I just barely use it when I need to. Anyway, thanks for sharing your experience. I |
Maxim 8-Feb-2012 [2792] | learning parse requires baby steps and at some point, the decision to solve a real problem with it and force yourself to learn it. I didn't use parse for almost a decade until I started using it more and more to a point that currently I do more parse than any other coding in REBOL (but that's just because its idealy suited for this). some little tricks accumulate with experience and eventually, we discover pretty wacky things, which allow us to use parse almost like a VM. |
Oldes 8-Feb-2012 [2793] | Parse is REBOL's heart... I cannot imagine living without it. |
Pekr 9-Feb-2012 [2794] | REBOL parse is a gem, a treasure to follow. Me, the coding lamer, did few things using it. Guys coding C++ first came meh, well, interpreter. Then - how is it possible it is faster than C++ app? Later on, they came with new requests asking - well, you know, you have that parser, we need to do following stuff ... |
ddharing 9-Feb-2012 [2795] | Well said, Oldes. |
james_nak 9-Feb-2012 [2796] | Guys, with all this said (and I agree), perhaps this is the one things that needs to be the focal point for Rebol and eventually the #Not Rebol languages. I know there are some tutorials out there but do any of them do justice to parse? I keep going back to the Codeconscious one: http://www.codeconscious.com/rebol/parse-tutorial.htmland the ones at reboltutorial, but there doesn't seem to be a lot considering how much one can do with it. |
Maxim 9-Feb-2012 [2797] | I learnt parse using the 2.3 rebol core guide... I thought it did a pretty good job of launching one in the good direction. parse HAS evolved since then, but for the basic semantics and principles of parsing I think its pretty good. you can also look at this tutorial by Nick Antonaccio: http://musiclessonz.com/rebol_tutorial.html#section-9.3 IIRC nick has a good sense of tutoring, so it may be a good first step... he also gives links to other parse resources at the end of that part of his (short) tutorial |
Pekr 9-Feb-2012 [2798] | Max - are you using R2 parse, or R3 enhanced one? |
Maxim 9-Feb-2012 [2799] | R2. since we compile just about all the rules from other datasets and simplified user-data, the R3 advantage is much less significant (because we can simulate all the R3 improvements by using R2 idoms, though its sometimes tricky). Using R3, it probably would be a few percent faster since some of the rules we have would be simpler and those tricks would be managed natively by parse rather than by *more* parse rules. |
james_nak 9-Feb-2012 [2800] | Thanks Maxim. I appreciate the info. |
Maxim 9-Feb-2012 [2801x2] | The problem with R3 right now is that it isn't yet compiled in 64-bits we still have the 1.6GB RAM limit for a process which is the biggest issue right now. I have blown that limit a few times already, so it makes things a bit more complex and it doesn't allow me to fully optimize speed by using more pre-generated tables and unfolded state rules. |
Our datasets are huge and we optimise for performance by unfolding and indexing a lot of stuff into rules... for example instead of parsing by a list of words, I parse by a hierarchical tree of characters. its much faster since the speed is linear to the length of the word instead of to the number of items in the table. i.e. the typical O*n vs. O*O*n type of scenario . just switching to parse already was 10 times faster than using hash! tables and using find on them.... In the end, we had a 100 time speed improvement from before parse to compiled parse datasets. this means going from 30 minutes to less than 20 seconds....but this comes at a huge cost in RAM... a 400MB Overhead to be precise. | |
older newer | first last |