AltME groups: search
Help · search scripts · search articles · search mailing listresults summary
world | hits |
r4wp | 169 |
r3wp | 938 |
total: | 1107 |
results window for this page: [start: 1101 end: 1107]
world-name: r3wp
Group: #Boron ... Open Source REBOL Clone [web-public] | ||
Anton: 13-Jul-2006 | Jaime, an advantage to OpenRebol is that we don't have to go through changing all the code that looks like this: #define orResult(t,v) \ orSetTF(a1, t); \ a1->index = v; #define orResultCopy(v) orCopyV(a1,v) #define orResultSeries(t,w,idx) \ orSetTF(a1, t); \ orSetSeries(a1,w,idx) #define orResultSTRING(i) orResultSeries(OT_STRING,i,0) #define orResultFILE(i) orResultSeries(OT_FILE,i,0) #define orResultBLOCK(i) orResultSeries(OT_BLOCK,i,0) #define orResultBINARY(i) orResultSeries(OT_BINARY,i,0) #define orResultNONE orResult(OT_NONE,0) | |
Group: Core ... Discuss core issues [web-public] | ||
Maxim: 9-Feb-2012 | O*O*n == a typo :-) I guess I really meant something like O(n*n) Its the kind of dramatic linear vs logarithmic scaling difference when we unfold our datasets into parse. but its not exactly that kind of scaling, since the average topology of the sort tree will have a lot of impact on the end-result. for example in my system, when I try to index more than the first 5 characters, the speed gain is so insignificant that the ratio is quickly skewed, when compared to the difference which the first 3 letters give. Its 100% related to the actual dataset I use. in some, going past 2 is already almost useless, in others I will have to go beyond 5 for sure. in some other datasets we unfold them using hand-picked algorythms per branch of data, and others its a pure, brute force huge RAM gobler. | |
Group: Red ... Red language group [web-public] | ||
BrianH: 29-Dec-2011 | IF, UNLESS, EITHER, CASE and SWITCH all make sense to compile in a compiled language because they all translate to branches and/or index lookups in the generated code, and optimizing that would need some decent compiler support. If anything, CASE is the most general (the others can all be implemented with CASE), and would benefit the most from optimization. | |
Dockimbel: 8-Jan-2012 | In order for Red to appear on the Tiobe Index, one requirement is to have an entry on (english) Wikipedia, clearly describing it as a programming language, as explained here: http://www.tiobe.com/index.php/content/paperinfo/tpci/tpci_definition.htm I have contacted Tiobe and they are ok for including Red when this requirement will be fulfilled. If someone here is willing to do it, that would really help boost Red's visibility. That is typicaly something that I cannot do myself, it would go against Wikipedia's rules. | |
GrahamC: 7-Feb-2012 | And use google to index | |
Evgeniy Philippov: 13-Feb-2012 | http://en.wikipedia.org/w/index.php?title=Metaprogramming&oldid=472528422 | |
Group: World ... For discussion of World language [web-public] | ||
Geomol: 28-Nov-2011 | What wiki? http://www.rebol.com/r3/docs/index.html is listed as "REBOL 3 Documentation (wiki)" on http://www.rebol.com/docs.html Do you mean the "old" wiki: http://www.rebol.net/wiki/Table_Of_Contents |
1101 / 1107 | 1 | 2 | 3 | 4 | 5 | ... | 8 | 9 | 10 | 11 | [12] |