Re: ASUS Laptops - my experience Hardware and Software by Reverend Jim I called Best Buy Friday morning to ask about the status of my laptop. I was told the average wait time was one minute. Fifteen minutes later I was told there were eight calls ahead of me and would I like to leave my number for a callback. I did so and after two more hours of waiting I called the local Best Buy direct. I was told my laptop would be… Re: VB6 - RayCasting: why my Vertical intersection is so big? Programming Software Development by cambalinho actual code: Private Sub DrawRays2() Dim AY As Double Dim AX As Double Dim StepX As Double Dim StepY As Double Dim VertX As Double Dim VertY As Double Dim HorizX As Double Dim HorizY As Double Dim MapX As Long Dim MapY As Long Dim HorizDist … Extract Tabular Data from PDF Images using Hugging Face Table Transformer Programming Computer Science by usmanmalik57 In a previous article, I explained [how to extract tabular data from PDF image documents using Multimodal Google Gemini Pro](https://www.daniweb.com/programming/computer-science/tutorials/541449/pdf-image-table-extractor-web-app-with-google-gemini-pro-and-streamlit#post2296083). However, there are a couple of disadvantages with Google Gemini Pro. … GCC Fails to Recognize Parameters Programming by snah19 RE: ffmpeg-4.4 Andrew Wu DJGPP CROSS COMPILER, GCC v12.2.0 Host Macbook Pro, macOS Monterey [Click Here](https://ffmpeg.org/platform.html#DOS) DJGPP Cross Compiler 12.2.0 Fails to Recognize "certain" Parameters in FFmpeg Source Code Hi, I am using the DJGPP cross compiler 12.2.0, developed by Andrew Wu, github, to build the … 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: 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. 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 O (and o, which the OP asked about) describes the growth of a function. That function often describes the running time of an algorithm, but that's not important here. A statement like "2^n = O(n!)" (or "2^n = o(n!)") does not mean that the running time of an algorithm to compute 2^n is in O(n!)¹, it means that the asymptotic … Big O Notation Proofs Programming Computer Science by needhelp83 O-notation – O(g(n)) = { f (n) : there exist positive constants c and n0 such that 0 ≤ f (n) ≤ cg(n) for all n ≥ n0} – g(n) is an upper bound of f(n), may not be tight Ω-notation – Ω(g(n)) = { f (n) : there exist positive constants c and n0such that 0 ≤ cg(n) ≤ f(n) for all n ≥ n0} – g(n) is an lower … 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. Hhheeelllppp Me Please Hardware and Software Information Security by fuzzyp :o Hello everyone, Um , dont know whats happening. Could some one please help, thanks in advance. Logfile of HijackThis v1.99.1 Scan saved at 12:00:05, on 19/10/2005 Platform: Windows 2000 SP4 (WinNT 5.00.2195) MSIE: Internet Explorer v6.00 SP1 (6.00.2800.1106) Running processes: C:\WIN2K\Explorer.EXE C:\Program Files\Kerio\Personal … My husband will kill me if you don't help me! Hardware and Software Information Security by emilyz :o Hi, I (stupidly) tried to download something this morning and have been wrestling with trojan/popups/adware/etc. all day. I'm on my husband's computer, and if I don't fix it before he gets home, all hell will break loose. I'm begging for your help...the HijackThis log is found below: Logfile of HijackThis v1.99.1 Scan saved at 2:34:16 PM, …