[JesseParticipant]

You need a constructor in the “TweenEquationCallLinear”

thats the error I get when I try to check for errors. I added the “Method New()” and the error went away.

For safety purpose you should add a default constructor to all of your classes. if you don’t you might run into something similar when you try to implement something similar with other classes.

[JesseParticipant]

Thanks, I was trying to do some some experimenting and wasn’t sure if it was doable or not. I was just wondering if I could move a node from one list to another by doing it that way.

another question:
are linked Lists slow or just this module? I know arrays are faster but was wonder. I guess I could do some tests.

[JesseParticipant]

.

[JesseParticipant]

Mark, I saw that you modified the List to work with skn3 Post. My question is, Is the only way to use InsertBefore or InsertAfter by using nodes with in the list? I tried to add a removed node to it and it failed. produced an endless for loop. I tried it before the current modifications and after the modifications with same results.

Monkey

[crayon-5cba9e1ad0895398660298 inline="true" ] #Import "<std>" Using std.. Function Main:Void() Local items := New List<Item>() Local item1 := New Item("one") item1.node = items.AddLast(item1) Local item2 := New Item("two") item2.node = items.AddLast(item2) Local item3 := New Item("three") item3.node = items.AddLast(item3) Print "before" For Local item := Eachin items Print item.name Next item1.node.Remove() item2.node.InsertBefore(item1.node) Print "after" For Local item := Eachin items Print item.name Next Print "" End Class Item Field node:List<Item>.Node Field name:String Method New(name:String) Self.name = name 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

[crayon-5cba9e1ad0895398660298 inline="true" ] #Import "<std>" Using std.. Function Main:Void() Local items := New List<Item>() Local item1 := New Item("one") item1.node = items.AddLast(item1) Local item2 := New Item("two") item2.node = items.AddLast(item2) Local item3 := New Item("three") item3.node = items.AddLast(item3) Print "before" For Local item := Eachin items Print item.name Next item1.node.Remove() item2.node.InsertBefore(item1.node) Print "after" For Local item := Eachin items Print item.name Next Print "" End Class Item Field node:List<Item>.Node Field name:String Method New(name:String) Self.name = name End End

[/crayon]

[JesseParticipant]

Got it! Thanks Mark.

[JesseParticipant]

I created a simple generic pool class. I think t’s as fast as it can get. it has no limitation on size and has a return to pool function. The only requirements is that all objects to be stored or created must extend StoreObject class:

Monkey

[crayon-5cba9e1ad85df010178979 inline="true" ] '******************************************************* '* Pool * '******************************************************* Class Store<T> Field last:T Field total:Int Method New() End Method Method New(count:Int) Fill(count) End Method Method Fill:Void(total:Int) For Local i:Int = 0 Until total Local c:T = New T c._pred = last last = c Next Self.total += total End Method Method Count:Int() Return total End Method Method GetItem:T() If last Local c:T = last last = Cast<T>(last._pred) c._pred = Null total -= 1 Return c Endif Return New T End Method Method ReturnItem:Void(obj:T) obj._succ = Null obj._pred = last last = obj total += 1 End Method End Class Class StoreObject Abstract Field _pred:StoreObject Method New() End method End Class

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

[crayon-5cba9e1ad85df010178979 inline="true" ] '******************************************************* '* Pool    * '*******************************************************   Class Store<T> Field last:T Field total:Int Method New() End Method Method New(count:Int) Fill(count) End Method   Method Fill:Void(total:Int) For Local i:Int = 0 Until total Local c:T = New T c._pred = last last = c Next Self.total += total End Method Method Count:Int() Return total End Method Method GetItem:T() If last Local c:T = last last = Cast<T>(last._pred) c._pred = Null total -= 1 Return c Endif Return New T End Method Method ReturnItem:Void(obj:T) obj._succ = Null obj._pred = last last = obj total += 1 End Method End Class   Class StoreObject Abstract Field _pred:StoreObject Method New() End method End Class

[/crayon]

[JesseParticipant]

can I clear a pixel from the canvas Image to 0,0,0,0? I know I can draw a pixel with alpha 0 and it will just leave the canvas pixel as is but I need to clear the canvas pixel alpha to 0. I mean the canvas from an image.

[JesseParticipant]

I went from using DrawImage, to using DrawRect to draw the images and it has improved the speed significantly not as fast as the original but pretty close now. it’s doable. I am wondering if the Image class or DrawImage is the cause of the slowdown.

[JesseParticipant]

I did but didn’t help much. it is still quite a bit slower than the previous version.

[JesseParticipant]

what’s with the printing of “Flush!” over and over. I think it might have something to do with the slowdown. Does it in debug and release mode.
release mode seems to be slow also.

[JesseParticipant]

Thanks Mark.
I am not concerned with the speed of the enscripten target I was expecting it to be a bit slower. I was concerned with the speed difference in the desktop target. I figured that if I could keep about 55fps it would be ok in release mode but now I can’t be sure anymore. and it’s going to be a bother to be checking release mode every time I want to check it’s performance.

[JesseParticipant]

here:

Attachments:

1. MissionPatrol.zip
2. MissionPatrol-1.zip

[JesseParticipant]

I just saw your last post. Yes, that would help.

[JesseParticipant]

Thats funny, I have been through the string documentation several times but for some reason I never actually payed attention to those functions.

[JesseParticipant]

here a more complete set:

Monkey

[crayon-5cba9e1af15cd360651536 inline="true" ] #import "<std>" Using mojo.. Using std.. Function DecimalToHex:String(dec:Int) If(Not dec) Then Return "00" Local dic:String = "0123456789ABCDEF" Local hex:String = "" While(dec) Local bits := dec & $f Local hi := String.FromChar(dic[bits]) hex = hi + hex dec = dec Shr 4 Wend Return hex End Function DecimalToBin:String(dec:Int) If(Not dec) Then Return "0" Local bin:String = "" While(dec) bin = String(dec & 1) + bin dec = dec Shr 1 Wend Return bin End Function HexToDecimal:Int(str:String) If str = "" Return 0 Local dic := "0123456789ABCDEF" Local dec :Int = 0 While str.Length > 0 Local char := str.Left(1).ToUpper() If dic.Contains(char) dec = (dec Shl 4) | dic.Find(char) Else Return 0 Endif str = str.Mid(1,str.Length-1) Wend Return dec End Function Function BinToDec:Int(str:String) If str = "" Return 0 Local dec :Int = 0 While str.Length > 0 Local char := str.Left(1) If char = "0" Or char = "1" dec = (dec Shl 1) | Int(char) Else Return 0 Endif str = str.Mid(1,str.Length-1) Wend Return dec End Function Function Main() Print(DecimalToHex(26)) Print(DecimalToBin(5)) Print(HexToDecimal("1aA")) Print(BinToDec("10001")) 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

[crayon-5cba9e1af15cd360651536 inline="true" ] #import "<std>"   Using mojo.. Using std..   Function DecimalToHex:String(dec:Int)   If(Not dec) Then Return "00"   Local dic:String = "0123456789ABCDEF" Local hex:String = "" While(dec) Local bits := dec & $f Local hi := String.FromChar(dic[bits]) hex = hi + hex dec = dec Shr 4 Wend Return hex   End   Function DecimalToBin:String(dec:Int)   If(Not dec) Then Return "0"   Local bin:String = "" While(dec) bin = String(dec & 1) + bin dec = dec Shr 1 Wend Return bin End   Function HexToDecimal:Int(str:String) If str = "" Return 0 Local dic := "0123456789ABCDEF" Local dec :Int = 0 While str.Length > 0 Local char := str.Left(1).ToUpper() If dic.Contains(char) dec = (dec Shl 4) | dic.Find(char) Else Return 0 Endif str = str.Mid(1,str.Length-1) Wend Return dec End Function   Function BinToDec:Int(str:String) If str = "" Return 0 Local dec :Int = 0 While str.Length > 0 Local char := str.Left(1) If char = "0" Or char = "1" dec = (dec Shl 1) | Int(char) Else Return 0 Endif str = str.Mid(1,str.Length-1) Wend Return dec End Function   Function Main()   Print(DecimalToHex(26)) Print(DecimalToBin(5)) Print(HexToDecimal("1aA")) Print(BinToDec("10001")) End

[/crayon]

[Author]

Posts