[nerobotParticipant]

Nice looking!

What is the base for editor? Mx1, mx2, bmax, … ?

[nerobotParticipant]

@Mark

I have idea about mojox – in views like TreeView delegate drawing command to child ‘item’ classes (Node in this case), and then we can easily override this for our custom nodes.

Also there is a way to make TreeView generic:

TreeView<T> where T extends TreeView.Node

So, custom nodes will draw themselves without changing TreeView.

[nerobotParticipant]

Hi to all.

Let me introduce new improved version.

It based on latest official ted2 sources (1.0.7).

See screenshots below.

What do we have now:

• improved parser

– it can extract variable type from expressions like this:

Monkey

Local img := Image.Load(...) 'so img is Image type

1	Local img := Image.Load(...) 'so img is Image type

– parse lambdas, enums, method’s params

– parse ‘native’ types like @String

• improved autocompletion

– it checks current scope and access mode (public/private)

– added icons and sorting

• improved codetree

– it shows types and params

– added icons

—————–

As in previous version – parser do re-parse on load and on save document.

So if you type variable and don’t see autocompletion – just save the file and try again.

Parser is ‘in progress’, it can parse not all cases. You can notify me here about ‘problem places’.

And problems with autocompletion too.

—————–

If you don’t try Ted2Go yet – do it right now!

And maybe donate me if it’s useful for you.

Sources on github  |  Compiled windows version (dropbox)  |  Donate

Have a nice coding!

Attachments:

1. 

   ted2go_codetree.png
   

2. 

   ted2go_complete.png
   

3. 

   ted2go_complete1.png
   

4. 

   ted2go_complete3.png
   

[nerobotParticipant]

Your formula looks like a magic for me.

And it’s offtopic here.:)

[nerobotParticipant]

Litehtml  has layout engine only, not contains paint engine. So there is no css support.

 

About ted2 – you can find some planned features on my fork here https://github.com/engor/Ted2Go

What about official version – I don’t know.

[nerobotParticipant]

Sorry for belated answer about my poly checking function.

I wrote demo for demonstration. It contains Polygon class and some helpers.

Full code:

Monkey

Namespace polytest #Import "<std>" #Import "<mojo>" Using std.. Using mojo.. Function Main() New AppInstance Local wnd := New AppWindow("Polygon Test", 600, 600) Local game := New GameLogic wnd.OnRenderCallback += Lambda(canvas:Canvas) game.Draw(canvas) End App.Run() End ' AppWindow Class AppWindow Extends Window Field OnRenderCallback:Void(canvas:Canvas) Method New( title:String,width:Int,height:Int,flags:WindowFlags=Null ) Super.New( title,New Recti( 0,0,width,height ),flags|WindowFlags.Center ) End Method OnRender(canvas:Canvas) Override App.RequestRender() OnRenderCallback(canvas) End End ' GameLogic Class GameLogic Method New() Local poly := New Polygon(New Float[](0,0, 150,50, 200,100, 100,150)) poly.Origin = New Vec2f(100,50) polyObj = New PolyObject polyObj.poly = poly polyObj.pos = New Vec2f(300,300) End Method Update() Local p := Mouse.Location Local over := polyObj.PointIn(p.x, p.y) polyObj.color = over ? Color.Green Else Color.Blue polyObj.poly.Rotate(0.005) End Method Draw(canvas:Canvas) Update() 'hm, update in draw... polyObj.Draw(canvas) End Private Field polyObj:PolyObject End ' PolyObject Class PolyObject Field poly:Polygon Field pos:Vec2f Field color := Color.White Method Draw(canvas:Canvas) If poly = Null Return Local p := pos-poly.Origin canvas.Translate(p.x,p.y) canvas.Color = color canvas.DrawPoly(poly.Points) canvas.Color *= 0.25 canvas.DrawRect(poly.Bounds) canvas.Color = Color.Black canvas.DrawOval(poly.Origin.x-2, poly.Origin.y-2, 4, 4) End Method PointIn:Bool(px:Float, py:Float) px -= pos.x-poly.Origin.x 'bad place to get poly.Origin py -= pos.y-poly.Origin.y Return poly.PointIn(px, py) End End ' Polygon Class Polygon Method New(xyArray:Float[]) _points = New Float[xyArray.Length] For Local k := 0 Until xyArray.Length _points[k] = xyArray[k] Next UpdateBounds() End Method New(rect:Rectf) _points = New Float[8] _points[0] = rect.Left _points[1] = rect.Top _points[2] = rect.Right _points[3] = rect.Top _points[4] = rect.Right _points[5] = rect.Bottom _points[6] = rect.Left _points[7] = rect.Bottom _bounds = rect End Property Points:Float[]() Return _points End Property Bounds:Rectf() Return _bounds End Property Origin:Vec2f() Return _origin Setter(value:Vec2f) _origin = value End Property Rotation:Float() Return _rotation End Method Rotate(angle:Float) Local ox := _origin.x Local oy := _origin.y Local cos := Cos(angle) Local sin := Sin(angle) For Local k := 0 Until _points.Length Step 2 Local px := _points[k]-ox Local py := _points[k+1]-oy _points[k] = ox + px*cos - py*sin _points[k+1] = oy + px*sin + py*cos Next _rotation = (_rotation + angle) Mod 360.0 UpdateBounds() End Method Move(dx:Float, dy:Float) For Local k := 0 Until _points.Length Step 2 _points[k] += dx _points[k+1] += dy Next Local v := New Vec2f(dx,dy) _bounds += v _origin += v End Method PointIn:Bool(point:Vec2f) If Not _bounds.Contains(point) Then Return False Return PointIn(_points,point) End Method PointIn:Bool(px:Float, py:Float) Return PointIn(New Vec2f(px,py)) End Function PointIn:Bool(xy:Float[], point:Vec2f) Local px := point.x, py := point.y Local x1:Float, y1:Float, x2:Float, y2:Float Local koef:Float, koefA:Float Local cnt:Int = xy.Length Local sign:Int, sign2:Int For Local k := 0 Until cnt Step 2 x1 = xy[k] y1 = xy[k + 1] If k + 3 < cnt x2 = xy[k + 2] y2 = xy[k + 3] Else 'connect with first point x2 = xy[0] y2 = xy[1] Endif sign = Sgn(x2 - x1) sign2 = Sgn(px - x1) 'prevent division by zero If sign = 0 x2 += 0.0001 sign = 1 Endif If sign2 = 0 px += 0.0001 sign2 = 1 EndIf 'the slope coefficient (y = k*x + b) koef = (y1 - y2) / (x2 - x1) koefA = (y1 - py) / (px - x1) 'checking If (sign2 = sign And koefA > koef) Or (sign2 <> sign And koefA < koef) Return False Endif Next Return True End Function Private Field _points:Float[] 'xy pairs in one dimention array Field _bounds:Rectf 'bounds used for fast collision detection Field _origin := New Vec2f(0,0) Field _rotation:Float Method UpdateBounds() Local minX := _points[0] Local maxX := _points[0] Local minY := _points[1] Local maxY := _points[1] For Local k := 2 Until _points.Length Step 2 Local px := _points[k] Local py := _points[k+1] If px < minX minX = px Elseif px > maxX maxX = px Endif If py < minY minY = py Elseif py > maxY maxY = py Endif Next If _bounds = Null Then _bounds = New Rectf _bounds.Left = minX _bounds.Right = maxX _bounds.Top = minY _bounds.Bottom = maxY End End

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280

Namespace polytest     #Import "<std>" #Import "<mojo>"     Using std.. Using mojo..       Function Main()   New AppInstance   Local wnd := New AppWindow("Polygon Test", 600, 600) Local game := New GameLogic wnd.OnRenderCallback += Lambda(canvas:Canvas) game.Draw(canvas) End App.Run() End     ' AppWindow   Class AppWindow Extends Window   Field OnRenderCallback:Void(canvas:Canvas) Method New( title:String,width:Int,height:Int,flags:WindowFlags=Null ) Super.New( title,New Recti( 0,0,width,height ),flags|WindowFlags.Center ) End Method OnRender(canvas:Canvas) Override App.RequestRender() OnRenderCallback(canvas) End End     ' GameLogic   Class GameLogic   Method New() Local poly := New Polygon(New Float[](0,0, 150,50, 200,100, 100,150))         poly.Origin = New Vec2f(100,50) polyObj = New PolyObject polyObj.poly = poly polyObj.pos = New Vec2f(300,300) End Method Update() Local p := Mouse.Location                  Local over := polyObj.PointIn(p.x, p.y)         polyObj.color = over ? Color.Green Else Color.Blue                  polyObj.poly.Rotate(0.005) End Method Draw(canvas:Canvas) Update() 'hm, update in draw... polyObj.Draw(canvas) End Private Field polyObj:PolyObject End     ' PolyObject   Class PolyObject   Field poly:Polygon Field pos:Vec2f Field color := Color.White Method Draw(canvas:Canvas) If poly = Null Return Local p := pos-poly.Origin canvas.Translate(p.x,p.y) canvas.Color = color canvas.DrawPoly(poly.Points) canvas.Color *= 0.25 canvas.DrawRect(poly.Bounds) canvas.Color = Color.Black canvas.DrawOval(poly.Origin.x-2, poly.Origin.y-2, 4, 4) End Method PointIn:Bool(px:Float, py:Float) px -= pos.x-poly.Origin.x 'bad place to get poly.Origin py -= pos.y-poly.Origin.y Return poly.PointIn(px, py) End End     ' Polygon   Class Polygon   Method New(xyArray:Float[]) _points = New Float[xyArray.Length] For Local k := 0 Until xyArray.Length _points[k] = xyArray[k] Next UpdateBounds() End Method New(rect:Rectf) _points = New Float[8] _points[0] = rect.Left _points[1] = rect.Top _points[2] = rect.Right _points[3] = rect.Top _points[4] = rect.Right _points[5] = rect.Bottom _points[6] = rect.Left _points[7] = rect.Bottom _bounds = rect End Property Points:Float[]() Return _points End Property Bounds:Rectf() Return _bounds End Property Origin:Vec2f() Return _origin Setter(value:Vec2f) _origin = value End Property Rotation:Float() Return _rotation End Method Rotate(angle:Float) Local ox := _origin.x Local oy := _origin.y Local cos := Cos(angle) Local sin := Sin(angle) For Local k := 0 Until _points.Length Step 2 Local px := _points[k]-ox Local py := _points[k+1]-oy _points[k] = ox + px*cos - py*sin _points[k+1] = oy + px*sin + py*cos Next _rotation = (_rotation + angle) Mod 360.0 UpdateBounds() End Method Move(dx:Float, dy:Float) For Local k := 0 Until _points.Length Step 2 _points[k] += dx _points[k+1] += dy Next Local v := New Vec2f(dx,dy) _bounds += v _origin += v End Method PointIn:Bool(point:Vec2f) If Not _bounds.Contains(point) Then Return False Return PointIn(_points,point) End Method PointIn:Bool(px:Float, py:Float) Return PointIn(New Vec2f(px,py)) End Function PointIn:Bool(xy:Float[], point:Vec2f) Local px := point.x, py := point.y Local x1:Float, y1:Float, x2:Float, y2:Float Local koef:Float, koefA:Float Local cnt:Int = xy.Length Local sign:Int, sign2:Int For Local k := 0 Until cnt Step 2 x1 = xy[k] y1 = xy[k + 1] If k + 3 < cnt x2 = xy[k + 2] y2 = xy[k + 3] Else 'connect with first point x2 = xy[0] y2 = xy[1] Endif sign = Sgn(x2 - x1) sign2 = Sgn(px - x1) 'prevent division by zero If sign = 0 x2 += 0.0001 sign = 1 Endif If sign2 = 0 px += 0.0001 sign2 = 1 EndIf 'the slope coefficient (y = k*x + b) koef = (y1 - y2) / (x2 - x1) koefA = (y1 - py) / (px - x1) 'checking If (sign2 = sign And koefA > koef) Or (sign2 <> sign And koefA < koef) Return False Endif Next Return True End Function Private Field _points:Float[] 'xy pairs in one dimention array Field _bounds:Rectf 'bounds used for fast collision detection Field _origin := New Vec2f(0,0) Field _rotation:Float Method UpdateBounds() Local minX := _points[0] Local maxX := _points[0] Local minY := _points[1] Local maxY := _points[1] For Local k := 2 Until _points.Length Step 2 Local px := _points[k] Local py := _points[k+1] If px < minX minX = px Elseif px > maxX maxX = px Endif If py < minY minY = py Elseif py > maxY maxY = py Endif Next If _bounds = Null Then _bounds = New Rectf _bounds.Left = minX _bounds.Right = maxX _bounds.Top = minY _bounds.Bottom = maxY End End

[nerobotParticipant]

Looked nice! keep doing 

[nerobotParticipant]

Working on code parser I just added simple CodeTreeView navigator – I need it to see parsing result.

There are idents only in the tree, that’s enough for the moment.

All variables started with Local, Field and so on is presented here, even if they are deep inside of For, If, etc. Will be fixed later.

CodeTreeView filled on document open, don’t adjust changes yet.

Click on item – jump to line with it.

Attachments:

1. 

   2016-09-21_23-21-32.png
   

[nerobotParticipant]

I’m using the latest version (1.0.6).

But my code is dirty now; I clean up it when complete common features (like checking current scope and getting variable types in := expression.

Now I’m using ‘dev’ branch for undone things.

[nerobotParticipant]

It’s bad idea to use ‘this’ as var name because it’s reserved word in c++ (into which monkey code translating).

[nerobotParticipant]

Useful git command for all fork-men:

Monkey

git subtree split -P src/ted2 -b ted2only

1	git subtree split -P src/ted2 -b ted2only

Separate all-and-only ted2 changes into custom branch.

Then we can easily merge with our fork – pull from branch ted2only into fork repo (if repo contains ted2 stuff only, not all monkey2).

[nerobotParticipant]

Atlas editor is greate thing, good luck with it!

[nerobotParticipant]

It would be nice to implement Animation creation tool in Ted… but this requires to code some relative stuff like Animator and AnimationClip. Something like in unity3d, simplier of course.

[nerobotParticipant]

Nice to hear you!

and fast compiling

Because there is just a bit of code. Ted2 is small app

But ‘clean’ compiling (no cached files yet) makes me wait.

[nerobotParticipant]

What does exactly mean += in this case?

This mean ‘subscribe’ to KeyEventFilter function inside of App.

This Lambda is a listener.

So all listeners subscribed to KeyEventFilter (via += operator) will be called when App begin processing keyboard event.

This call  is  usual function call, in our case: KeyEventFilter(event)

If there is no one listener subscribed to then nothing happen.

[Author]

Posts