http://blog.gmane.org/gmane.comp.lang.gambas.user hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://permalink.gmane.org/gmane.comp.lang.gambas.user/18815 <pre>Status: New Owner: ---- Labels: Version Type-Bug Priority-Medium OpSys-Any Dist-Any Arch-Any Desktop-Any GUI-Any New issue 252 by emil.len...&lt; at &gt;gmail.com: Enumerating Param for constant strings memory leak. http://code.google.com/p/gambas/issues/detail?id=252 1) Describe the problem. This code results in "gbx3: warning: 2 allocation(s) non freed." since revision 4248. ' Gambas module file Public Function varargs(...) Dim v As Variant For Each v In Param Print v Next End Public Sub Main() varargs("Testing a problem string.") End According to Valgrind, the allocation stack backtrace is malloc my_malloc STRING_new VALUE_convert GB_ReturnConvVariant EXEC_native EXEC_special EXEC_enum_next EXEC_loop EXEC_function_real main 2) GIVE THE FOLLOWING INFORMATIONS (if they are appropriate): Version: TRUNK Revision: r4248 ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> gambas< at >googlecode.com 2012-05-24T15:40:08 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18814 <pre> What I, however, was trying to say is: every node can be the root of a tree and at the same time a node within another tree, in that point, we already met, right? So there has to be _one_ node class for the generic node above (that can possess both attributes) that implements methods which resemble the tree algorithms. That way we could have a basic tree datastructure - if it is that simple. This basic datastructure can be inherited, overridden, etc. If the node class is aware of these both attributes (being root node of a tree and itself node in a tree at the same time) one can easily concatenate trees and that's what I wanted to show with my code above. (Sorry if I re-invent the wheel here) What you were out for, if I got you right, was only providing a datastructure for nodes and a separate class with code to handle them? Like pluggable algorithms on the same structures? (Hrm, regarding your timezone you must be somewhere near Autralia...) The word can be another one down there, it is the highest school graduation level here and really far from painful, almost simplistic. But back to the topic. It would be nice if there was someone to implement that natively. I'm not going to promise anything but I have a book lying around here with a relatively short chapter on graphs (and trees) and almost half a week of holidays left... :) If only, it could be preliminary work to gb.datastructures (even if I find that the name could be improved) Regards, Tobi ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> tobi 2012-05-24T11:34:29 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18813 <pre> No, any node can be considered as a root for a subtree. Anynode.parent provides what I think your saying. (Aside, I think that separating the functionality from the node is the key of what I was trying to say. But that is a side issue.) Only in that the "tree" happens to be a directed graph that has one special node. I told you graphs were interesting. Having been born some time in the middle of the last century, I have no idea what an A-level is. I hope it's not painful. :-) and regards from me too! But if A-levels are what I think they are, I can recall thinking some 40 years ago, "calculus, as if I am ever going to need that in my life, ha!". Wrong. :-) Now get back to those books! ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Bruce 2012-05-24T10:49:35 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18812 <pre> (Completely giving up anything I knew about binary trees now, because it wasn't much and it wasn't even from a book): You said that you can traverse from any node in the tree. Consequently every node has to provide such functionality. I don't deem it necessary to distinguish between root and other nodes. The code is only once there anyway. It could even have helped in your case to "em-parent" (sorry, not a native English speaker) a node that you formerly assumed to be the root like NewNode.Left = RootNode RootNode = NewNode As interesting as it sounds, I'm probably not the right person to work on this. I don't have much time for (I don't think so but from a pure conscientiousness point I need to prepare my A-level a bit) and nobody else wants to wait until I finish the theory ;) Regards, Tobi ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> tobi 2012-05-24T09:07:21 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18811 <pre> Hi Kevin. I think you should concider using Glu.LookAt function, which should solve all your problems. I used it in collision project (attached) to follow the ball. You just set the camera with few parameters, and that's it! Please check the command help in Gambas. Simply speaking, you define eye point's (x,y,z position - no need for scale or translate), point you look at and point where the top of camera is (by changing it, you rotate the world in front of you), so I think that would solve it. See the attached example to see how I did it. Press F3 to see how it works. NAME gluLookAt - define a viewing transformation C SPECIFICATION void gluLookAt( GLdouble eyeX, GLdouble eyeY, GLdouble eyeZ, GLdouble centerX, GLdouble centerY, GLdouble centerZ, GLdouble upX, GLdouble upY, GLdouble upZ ) PARAMETERS eyeX,eyeY, eyeZ Specifies theposition of theeye point. centerX, centerY, centerZ Specifies theposition of thereference point. upX, upY, upZ Specifies thedirection of the up vector. DESCRIPTION gluLookAt creates a viewing matrix derived from an eye point, a reference point indicating the center of thescene, and an UP vector. The matrix maps the referencepoint to the negative zaxis and the eye point to the origin. When a typical projection matrix is used, the center ofthe scene therefore maps to the center ofthe viewport. Similarly, the direction described by the UP vector projected onto theviewingplane is mapped to the positive y axis so that it points upward in the viewport. The UPvector must notbe parallel to the line of sightfrom the eye point to the reference point. Let (centerX - eyeX ) F = | | |centerY - eyeY | (centerZ - eyeZ ) Let UP be thevector (upX,upY,upZ). Then normalize as follows: f = _____ ||F|| UP' =______ ||UP|| Finally, let s = f x UP', andu = s xf. M is then constructedas follows: (s[0] s[1] s[2] 0 ) |u[0] u[1] u[2] 0 | M = | | |-f[0] -f[1] -f[2] 0 | | 00 0 1 | ( ) and gluLookAtis equivalent to glMultMatrixf(M); glTranslated (-eyex, -eyey, -eyez); I hope I did help. Tomek. Hi Tomek. I'm not sure that saving and loading the matrix will do the trick, but I don't really understand the implications of doing so either. I basically want to translate, scale and rotate the matrix so that the camera is always at the center of the render window and I can draw objects using their native world coordinates. The camera is pointing straight down at the ground (perpendicular to the landscape). Rotating the camera/matrix will spin the landscape with the camera being the origin, just like spinning a globe of Earth if the camera is pointing down at the north pole. It would look something like this: http://www.youtube.com/watch?v=mee_FiIQoEY If I do this below everything is perfect (including zoom) but it has no rotation: ' Rotate, translate and scale matrix. ScreenOffsetX = sWidth / 2 / 128 / Zoom.Current ScreenOffsetY = sHeight / 2 / 128 / Zoom.Current Gl.LoadIdentity() Gl.Scalef(128 * Zoom.Current, 128 * Zoom.Current, 1) Gl.Translatef(- Camera.WorldX + ScreenOffsetX, - Camera.WorldY + ScreenOffsetY, 0) Incorporating rotation rotates the scene but not around the camera. Using the above code and then rendering everything at its native world coordinates looks like this: http://eightvirtues.com/sanctimonia/misc/Everything%20But%20Rotation.ogv If necessary I can translate the matrix by (x,y) units which have been pre-rotated opposite the angle the matrix was rotated at. I can basically manually "undo" the matrix rotation if it needs to be translated post rotation, if that makes any sense. Some instinct inside me keeps nagging that I might need to do a trick like that to get it to work. </pre> tommyline< at >eircom.net 2012-05-24T09:00:56 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18810 <pre>Hi Tobi, I probably didn't make it clear. "Any n-tree can be transformed into a b-tree where the left branch is the first child and the right branch is the first sibling." To be more correct I should have said "Any k-ary tree can be represented as a binary tree where the left branch is the first child and the right branch is the next sibling". The theory is in wikipedia here: http://en.wikipedia.org/wiki/Binary_tree#Encoding_general_trees_as_binary_trees. These binary trees have well known (Knuth and others) algrorithms for different actions to be used on the binary tree, insertions, deletions, (graft and prune), traversals in particular orders, searches, sorts etc etc. The application of a binary tree structure to suit a particular problem is a different matter. This is what you can use the tree for or how to apply the tree "structure" to solve a particular problem. In my case, which was a set of rows in a database containing a "data" component and a "parent" value that I was trying to populate a treeview with (1800 records) where the rows were out of order with respect to building the treeview. It was an n-level "table of contents" thing. Rather than try to traverse the database several times and resolve getting each toc level resolved, I just read the whole thing as a single db.result and created a binary tree of the above type, creating dummy parent nodes as soon as I had a need for them and setting their "data" to a placebo value. When I later located the real parent row in the db.result iteration all I had to do was replace the placebo value with the nodes real data. At the end of the db.result iteration, the treeview could be populated via a pre-order traversal of that tree. Bingo. Regarding your "root,left,left,left" annoyance. No that is the way you need to get to the first node at a particular level of the tree. But once you're there there is an algorithm for traversing the tree at that level, an in-order traverse. In fact I could have used the in-order traversal equally well to solve my problem. What I am saying regarding "it would be nice to have" these things in a gb.component is they could provide the structure and the fundamental algorithms. The application of those things to the problem at hand still requires an understanding of how such structures and methods can be used to solve that problem, but at least the underlying infrastructure would be there. Every time one of these problems pops up in my life I have to go find which gambas project it was where I created the structures and algorithms. The trouble is I only ever do the minimum necessary in a particular project. So if, for problem "x" I reckon that a binary tree in-order search is needed then which *^%$&lt; at &gt; project did I use that last in, etc. etc. and then get wrapped up in the code for the tree itself rather than its' application to the problem at hand. I think that the binary tree structure only requires two classes, say "bintree" and "bintreenode". The bintree class contains the root node and all the basic algorithms. The bintreenode class is a dumb data and reference holder. Unlike what I inferred in my first post it has no algorithm methods, it is just a structure. I'd also hazard a guess that much of the code needed is already somewhere in gambas hiding in the Collection indexing code, all it needs is exposing! Bruce ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ Gambas-user mailing list Gambas-user&lt; at &gt;lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/gambas-user </pre> Bruce 2012-05-24T08:41:27 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18809 <pre>If you need to install a Gambas runtime (I'm guessing yes?), then you'll need a hosting service that lets you do that. Most hosting services that give you a complete (virtual) machine with root access should be fine. You'll need to make sure they don't give you a Windoze host of course LOL Regards, Caveat On 24/05/12 07:41, Алексей Беспалов wrote: ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ Gambas-user mailing list Gambas-user&lt; at &gt;lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/gambas-user </pre> Caveat 2012-05-24T07:14:20 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18808 <pre>How works with component? for example Dim Con As New Connection *&lt;% Dim Quere, sChet As String Dim Row, Col, i As Integer Dim $Result As Result Dim Con As New Connection %&gt; * </pre> Алексей Беспалов 2012-05-24T06:58:44 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18807 <pre>Is there anywhere hosting for gambas web? Do you know? I do not want to learn more php, pyhon, ... </pre> Алексей Беспалов 2012-05-24T05:41:11 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18806 <pre>Thank you. It works with lighttpd successfully. Only need remove first string "#!/usr/bin/env gbw3" from web-page. ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Алексей Беспалов 2012-05-24T05:33:32 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18805 <pre> On 05/22/2012 03:02 AM, tommyline&lt; at &gt;eircom.net wrote: Hi Tomek. I'm not sure that saving and loading the matrix will do the trick, but I don't really understand the implications of doing so either. I basically want to translate, scale and rotate the matrix so that the camera is always at the center of the render window and I can draw objects using their native world coordinates. The camera is pointing straight down at the ground (perpendicular to the landscape). Rotating the camera/matrix will spin the landscape with the camera being the origin, just like spinning a globe of Earth if the camera is pointing down at the north pole. It would look something like this: http://www.youtube.com/watch?v=mee_FiIQoEY If I do this below everything is perfect (including zoom) but it has no rotation: ' Rotate, translate and scale matrix. ScreenOffsetX = sWidth / 2 / 128 / Zoom.Current ScreenOffsetY = sHeight / 2 / 128 / Zoom.Current Gl.LoadIdentity() Gl.Scalef(128 * Zoom.Current, 128 * Zoom.Current, 1) Gl.Translatef(- Camera.WorldX + ScreenOffsetX, - Camera.WorldY + ScreenOffsetY, 0) Incorporating rotation rotates the scene but not around the camera. Using the above code and then rendering everything at its native world coordinates looks like this: http://eightvirtues.com/sanctimonia/misc/Everything%20But%20Rotation.ogv If necessary I can translate the matrix by (x,y) units which have been pre-rotated opposite the angle the matrix was rotated at. I can basically manually "undo" the matrix rotation if it needs to be translated post rotation, if that makes any sense. Some instinct inside me keeps nagging that I might need to do a trick like that to get it to work. </pre> Kevin Fishburne 2012-05-24T02:14:40 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18804 <pre>Me to. Bye. 2012/5/24 Ru Vuott &lt;vuott&lt; at &gt;yahoo.it&gt; ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Emil Lenngren 2012-05-24T01:10:07 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18803 <pre>Ok, component works. Thanks Emil, thanks Benoit. I go to sleeeeep ! ;-) bye Vuottttttttt ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Ru Vuott 2012-05-24T01:09:17 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18802 <pre> mmmm... Emil... you are crazy ! ;-) You want to make me fool ! :-D ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Ru Vuott 2012-05-24T01:07:47 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18801 <pre> Yes, I tried now "without" Fast... Emil... oh my God ! Totally incomparable !! ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Ru Vuott 2012-05-24T01:05:50 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18800 <pre>Nice! Try without 'Fast' and see how long time you can wait before you get bored and abort it ;) 2012/5/24 Ru Vuott &lt;vuott&lt; at &gt;yahoo.it&gt; ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Emil Lenngren 2012-05-24T01:04:57 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18799 <pre> A few seconds (5 or 6 I suppose.) ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Ru Vuott 2012-05-24T01:01:52 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18798 <pre>Nice! Try to see the difference with the "Polygon" benchmark as well. 2012/5/24 Ru Vuott &lt;vuott&lt; at &gt;yahoo.it&gt; ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Emil Lenngren 2012-05-24T01:00:34 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18797 <pre> If 1000000000000 is too big, try a lower value. Gooooood suggestion, Benoît ! I changed value: from 1000000000000 to 1000000000 So, I tried "with" and "without" the word "FAST". I can see the difference !!!!!!!!!! :-) I think it works ! Oh, yes, it works and it's... fast ! ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Ru Vuott 2012-05-24T00:57:18 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18796 <pre>Ok, so try to replace the JIT_load method in main/gbx/gbx_jit.c with this one: bool JIT_load(){ static bool loaded = FALSE; static bool available = TRUE; if (loaded) return TRUE; if (!available) return FALSE; COMPONENT_load(COMPONENT_create("gb.jit")); LIBRARY_get_interface_by_name("gb.jit", JIT_INTERFACE_VERSION, &amp;JIT); JIT.Init((GB_JIT_INTERFACE *)(void *)GAMBAS_JitApi, &amp;EXEC_current, &amp;SP, &amp;TEMP, &amp;RET, &amp;GAMBAS_StopEvent, (char **)&amp;EXEC_enum, &amp;EXEC, &amp;EXEC_unknown_name, &amp;EVENT_Last, &amp;ERROR_current, &amp;ERROR_handler, &amp;STRING_char_string[0]); loaded = TRUE; return loaded; } Now it always throws an error if the jit couldn't be loaded. Another question: do you have another version of gbx3 installed somewhere that happen to run instead of the one with jit functionality? /Emil 2012/5/24 Emil Lenngren &lt;emil.lenngren&lt; at &gt;gmail.com&gt; ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Emil Lenngren 2012-05-24T00:52:06 http://permalink.gmane.org/gmane.comp.lang.gambas.user/18795 <pre>The thing is that llvm optimizes away that loop (at least on my 64-bit computer), so it should take 0 seconds ;) 2012/5/24 Benoît Minisini &lt;gambas&lt; at &gt;users.sourceforge.net&gt; ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ </pre> Emil Lenngren 2012-05-24T00:48:54 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.gambas.user