Re: ASUS Laptops - my experience Hardware and Software by Reverend Jim … must work) they were doing a final test. At two o'clock I went down. I was shown a laptop with… Re: Finished learning basics of html and css. What next? Community Center Geeks' Lounge by Dani Or you could try the React framework instead of Angular. I've heard better things about it. VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho …))) + (((VertY - Player.PosY)) * ((VertY - Player.PosY))) A.ForeColor vbRed 'obter o a linha mais curta(horizontal ou vertical): If VertDist <… Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho … = Abs((Player.PosX - VertX) / Cos(RayRadians)) 'A.ForeColor vbRed 'obter o a linha mais curta(horizontal ou vertical): If VertDist <… Extract Tabular Data from PDF Images using Hugging Face Table Transformer Programming Computer Science by usmanmalik57 … !wget "https://fonts.google.com/download?family=Roboto" -O roboto.zip !unzip roboto.zip -d ./roboto ``` The following script… GCC Fails to Recognize Parameters Programming by snah19 …"); return 0; } EOF "$TARGET_ARCH-gcc" helloai.c -o helloai || exit 1 # Compile FFmpeg echo "Compiling FFmpeg..."… Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by rproffitt For VertDist I would set a break on line 104 so I could examine the values in line 103. Also, could be a localization issue that the comma is used for the decimal point and the integer of the results might be 35 and 4548. Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho finally i found the problem is on these line: HorizDist = Sqr(((HorizX - Player.PosX) * (HorizX - Player.PosX)) + ((HorizY - Player.PosY) * (HorizY - Player.PosY))) 'works fine VertDist = Sqr(((VertX - Player.PosX)) * ((VertX - Player.PosX))) + (((VertY - Player.PosY)) * ((VertY - Player.PosY)))'calculation incorrect like … Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho not so easy :( WallDistance = WallDistance * Cos(Abs(RayRadians - Player.Radians)) 'avoiding the Fish Effect RayHeight = (ObjectSize / WallDistance) * 200 '320 is the width screen If (RayHeight > 200) Then RayHeight = 200 A.ForeColor vbBlue A.DrawLine 475 + 50 + RayCounts, 200 / 2 - … Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho i fix 1 error: ElseIf (KeyCode = vbKeyUp) Then If (LevelMap0(Fix((Player.PosY + Player.MoveY * Speed) / ObjectSize), Fix((Player.PosX + Player.MoveX * Speed) / ObjectSize)) <> vbBlue) Then 'and: ElseIf (KeyCode = vbKeyDown) Then If (LevelMap0(Fix((Player.PosY - Player.MoveY * Speed) / … Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho after several tests i fix it: Do While RayCounts < RayCount If (RayRadians > (2 * PI)) Then RayRadians = 0.001 i have more to update: 1 - win more performance\FPS; 2 - and trying avoid the 'on error resume next'(it's about the array dimensions): Private Sub DrawRays2() Dim AY As Double… Re: GCC Fails to Recognize Parameters Programming by Reverend Jim I can't offer any suggestions other than to just download the compiled app for your system instead of building it yourself. Re: GCC Fails to Recognize Parameters Programming by rproffitt Here's another problem. When we change the OS not only must we setup the compiler, environment and such but sometimes an OS API could be deprecated or removed. You made mention of a possible OS change so that's a possibility. You obtained this code from somewhere. Go back there and see if they updated it for your new OS. Re: GCC Fails to Recognize Parameters Programming by toneewa While I haven't used DJGPP for a couple decades, I decided to install the ffmpeg library and do a test program another way. For me, the declarations worked changing: #include "os_support.h" #include "avformat.h" #include "internal.h" #if CONFIG_NETWORK #include "network.h" #… Re: Optical Illusions Community Center Geeks' Lounge by christina>you ;o) Re: nNIVIDA Hardware and Software Microsoft Windows by caperjack ............................................ :o Re: NEEDS A News & Announcements Community Center Meta DaniWeb by xgmx o Re: Newbies buttons/links Community Center by turock o Re: Change-a-Letter-or-Two-Game Community Center Geeks' Lounge by eXceed69 o Re: Halo 3.... Community Center Geeks' Lounge by Duki :o Re: We need to laugh... Community Center Geeks' Lounge by christina>you ;o) Re: Extract icons Programming Software Development by dmf1978 :-O Re: Redirecting search engines, certain pages won't load, can't update antivirus, and ect Hardware and Software Information Security by crunchie O Re: MS Word messing up footers (e.g. Page {PAGE} of {NUMPAGES} Hardware and Software Microsoft Windows by nfj628 o Re: JavaFX scene builder 2: controller class Programming Software Development by Mkaveli o one?? Re: Who likes the tagging system? Community Center Meta DaniWeb by cereal o/ Re: o notation problem Programming Computer Science by sepp2k … like "2^n = O(n!)" (or "2^n = o(n!)") does not mean that… an algorithm to compute 2^n is in O(n!)¹, it means that the asymptotic growth of…! ignoring constants (and likewise "2^n = o(n!)" means that the asymptotic growth is strictly…the statements "2^n = O(n!)" and "2^n = o(n!)" are true because 2… Big O Notation Proofs Programming Computer Science by needhelp83 O-notation – O(g(n)) = { f (n) : there exist positive constants c and … bound for f(n) 1) [TEX]n^{2} + 2n^{3} = O(n^{3}) [/TEX] [TEX]f(n) = 2n^{3}, g(n…)= (n^{3}) [/TEX] if [TEX]f(n) \in O(g(n))[/TEX] [TEX]0 \leq f(n) \leq cg… Re: run time of a algorithm O(n) HELPP!!! Programming Software Development by hwoarang69 o also do you see a faster way of find value from array. in ex 5. Re: Big-O Time Complexity Programming Computer Science by arkoenig O(f(x)+g(x))=O(g(x)) whenever f(x) grows more slowly than g(x) as x increases without bound. Therefore, O(x+x^3)=O(x^3), and O(n+(n^2)log n)=O((n^2)log n). If you don't understand this, it means you need to learn about big-O notation in more detail.