Jump to content

Poulpus

Members
  • Content Count

    5
  • Joined

  • Last visited

Everything posted by Poulpus

  1. Poulpus

    F1 2019 UDP Specification

    Glad I could help 🤓 Keep us updated of what you do with your app 🙂
  2. Poulpus

    F1 2019 UDP Specification

    OK, it goes beyond my remaining knowledge of C# 🙂 Maybe just one suggestion: you are using struct annotations for PacketEventData and EventDataDetails, but not for the FastestLap struct. Could it be that the compiler arranges things on its own without any instructions, and messes it up? Maybe you could try to add StructLayout annotations to the FastestLap struct and see if it changes anything? Otherwise I would also advise to debug-print bit-by-bit what you receive in UDP and make sure you did not shift an index or two and read the wrong data at the wrong place (I had that kind of problems in Swift, and it can happen pretty quickly when you do things too fast...).
  3. Poulpus

    F1 2019 UDP Specification

    Hey @Bannish, it's been a while since I wrote my last line of C#, but looking at your code, is it normal that you cast the fastes lap time into a double (line 160)? As far as I remember, a float is 32 bits in size whereas double is 64 bits. From the UDP specs in this topic, it looks like the lap time is expressed in 32 bits-precision, so float would be the way to go here?
  4. Poulpus

    F1 2019 UDP Specification

    Thanks @CanTQuiT, I’m gonna try that!
  5. Poulpus

    F1 2019 UDP Specification

    Hi everyone, I am currently writing an app (cross-platform Mac/iOS) that would, among other things, replicate the live gaps we often see on TV between two drivers, which is updated every few seconds instead of every sector. However, this kind of information doesn't seem to be present in the UDP specs, so it must be calculated somehow. I'm looking for the best approach to get the most accurate results possible. Which data do you think would be most useful to process this? I'm currently thinking about using lap numbers, and distance traveled in the lap so far by the two drivers, then remember each frame in a big array, to compute the time it takes for the second driver to reach the lap distance from the first driver, but I'm not sure this is the best method, nor if it would produce very accurate results. Anyway, thanks for your ideas!
×