Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Repo info
Activity
  • Mar 24 18:06
    StevenLiekens commented #59
  • Mar 24 18:05
    StevenLiekens closed #59
  • Mar 24 18:05
    StevenLiekens commented #59
  • Mar 24 17:47
    StevenLiekens closed #58
  • Mar 24 17:47
    StevenLiekens commented #58
  • Mar 19 13:02
    Friesinator edited #59
  • Mar 19 13:01
    Friesinator opened #59
  • Mar 18 12:38
    StevenLiekens commented #58
  • Mar 15 15:19
    GHOSCHT commented #58
  • Mar 14 22:01
    Seeker1437 commented #58
  • Mar 14 20:08
    GHOSCHT commented #58
  • Mar 12 15:40
    StevenLiekens commented #58
  • Mar 10 15:46
    GHOSCHT opened #58
  • Apr 15 2018 16:43

    Ruhrpottpatriot on ServiceClient

    Remove superfluous compression … Add simple caching to Core proj… Move files into different folde… and 8 more (compare)

  • Apr 10 2018 21:09

    Ruhrpottpatriot on ServiceClient

    Add fluent api to create HttpRe… Fix Stylecop errors Remove dead code and 3 more (compare)

  • Mar 29 2018 13:11

    Ruhrpottpatriot on NetCore2.0

    Remove disabled and superseded … Delete unused leftover code fro… Move V1.Guild test to appropria… and 8 more (compare)

  • Mar 29 2018 12:17

    Ruhrpottpatriot on NetCore2.0

    Update .gitignore to exclude St… Add Api builder class (compare)

  • Feb 01 2018 09:33

    Ruhrpottpatriot on master

    Refactorize ServiceClient.GetHt… Merge pull request #57 from Kor… (compare)

  • Feb 01 2018 09:33
    Ruhrpottpatriot closed #57
  • Dec 27 2017 17:37
    Korjam opened #57
Steven Liekens
@StevenLiekens
the computersciency ones
Robert Logiewa
@Ruhrpottpatriot
ohj
those
Steven Liekens
@StevenLiekens
wow that was fast
Robert Logiewa
@Ruhrpottpatriot
^^
ok
those algos
Somewhat
Steven Liekens
@StevenLiekens
don't worry I'm not gonna ask you to write a quicksort
Robert Logiewa
@Ruhrpottpatriot
QS is easy^^
especially in Haskell
so what's it about
Steven Liekens
@StevenLiekens
just gonna ask if you've ever written a circular buffer
Robert Logiewa
@Ruhrpottpatriot
nope
why?
Steven Liekens
@StevenLiekens
I need one
Robert Logiewa
@Ruhrpottpatriot
in C#?
Steven Liekens
@StevenLiekens
yeah
Robert Logiewa
@Ruhrpottpatriot
tried something like a LinkedList for that?
I mean that's totally basic
but it should work
Steven Liekens
@StevenLiekens
the buffer is fixed size
linkedlist sounds overkill
Robert Logiewa
@Ruhrpottpatriot
yeah
hm
Steven Liekens
@StevenLiekens
I basically need a byte[] array and a way to remember how full the buffer is and where it begins or ends
it doesn't need to shrink or grow, ever
Robert Logiewa
@Ruhrpottpatriot
hmm
Steven Liekens
@StevenLiekens
the part that I'm stuck on is keeping track of where the head and tail are
Robert Logiewa
@Ruhrpottpatriot
Write your "own" Array class with two additional properties Start and End
We can safely assume that you always append after the last item
so we have no empty spaces
Steven Liekens
@StevenLiekens
problem is when head == tail, is the buffer full or empty?
Robert Logiewa
@Ruhrpottpatriot
Full, when the Length property equals the Size
otherwise empty
Steven Liekens
@StevenLiekens
I'm trying to understand this solution https://en.wikipedia.org/wiki/Circular_buffer#Mirroring
it seems like it has the most advantages
Robert Logiewa
@Ruhrpottpatriot
Personally, I'd use a fill count
That should be the most easy to implement
Steven Liekens
@StevenLiekens
wiki says it's not thread safe
Robert Logiewa
@Ruhrpottpatriot
yeah
Steven Liekens
@StevenLiekens
which is a requirement
for me
Robert Logiewa
@Ruhrpottpatriot
hmm
Steven Liekens
@StevenLiekens
and I suck at writing thread synchronization
Robert Logiewa
@Ruhrpottpatriot
hehe
yeah me too
Steven Liekens
@StevenLiekens
I just need to understand what the article says damn it
Robert Logiewa
@Ruhrpottpatriot
yeah
I try that too