Codesign gdb on OSX

Trying to use gdb on OSX El Capitan gave me following message. Solution? You need to codesign gdb with a custom certificate. Open Keychain Access In the menu, go to Certificate Assistant -> Create Certificate Choose an appropriate name like gdb-cert, set Identity Type to Self Signed Root, set Certificate Type to Codesign, and check Let me override defaults Optional: extend duration Click continue until specifying location for the certificate, choose System In System, click on gdb-cert, choose Get Info, go to Trust and set Code Signing to Always Trust Restart taskgated sudo kill -9 (which gdb)

July 7, 2016 · 1 min · 97 words · Gian Sass

The Mandelbrot Set, Part 1: Overview

Recently, I have been experimenting with the Mandelbrot set. I made a video where I showcased a simple Mandelbrot explorer, written in C++ and OpenGL. In this little series I want to explain what the Mandelbrot set really is, how to generate it, and how to program it in OpenGL! What is the Mandelbrot set? The Mandelbrot set is a set of points, which are determined by a simple iteration. For a certain amount of iterations, this equation is repeated for each points in the set and coloured appropriately....

July 6, 2016 · 3 min · 566 words · Gian Sass

An Overview of the Entity-Component-System

Game programming traditionally revolved around the concept of inheritance, that is, game objects and entities inherit functionality, and become more specific in their functioning as the inheritance gets more complex. But this type of architecture has evolved to be, in most cases, inefficient. As the game matures, functionality becomes increasingly complicated, which often results to deeply rooted chaos. To combat this cause, game programming has shown that the concept of Composition over Inheritance in such matters have turned out to be (sometimes) more efficient than an architecture based on inheritance....

June 9, 2016 · 3 min · 589 words · Gian Sass

Newton’s Method: Explanation and Example Usage

Polynomials are compex to solve. Sometimes they can be solved quite easily and sometimes it seems like solving them is impossible. Fortunately there exists something called Newton’s Method which lets you approximate roots of a polynomial by using the Taylor Series. The Taylor Series is defined as follows By using the first two terms of the Taylor Series, we can approximate a function at some differentiate point . You need to first find an approximation point to where a root could possibly be, for example by looking at the function’s graph or by iterating through some values of x and watching for close values to zero or changes of sign....

March 17, 2016 · 3 min · 612 words · Gian Sass

Trailing Zeros of Factorials

Since I’m bored to hell in programming class, my teacher, who is also my physics teacher, gave me the task to find out the trailing zeros of and then for . I then began searching for patterns in factorials starting from to 10!. Interestingly, has one trailing zero and has two trailing zeros. By induction you could determine the trailing zeros of factorials to be expressed by , where is the floor function....

March 11, 2016 · 2 min · 233 words · Gian Sass