Michael Pollmeier

* before this change, the entire element would be deserialized * because the majority of properties are actually unused, this should save us a lot of time * best used...

delete tasty files from output jars...

3

... these contain more information than the class files

use regular jdk String.intern()

6

I'm not sure why we didn't use `String.intern()` from the start. This PR doesn't only simplify our codebase, but saves us the `internedStrings` ConcurrentHashMap. The heap size for a large...

In large graphs we're wasting ~8% of the heap for duplicate arrays in `AdjacentNodes.offsets`. That array is only ever mutated in `AdjacentNodes.setOffset` in a very constraint and straighforward way, so...

In large graphs we're wasting almost 10% of the heap for null-entries in `AdjacentNodes.nodesWithEdgeProperties` - that's the `Object[]` which holds refs to all adjacent nodes (a.k.a. dummy edges) and the...

Ready for review, but not mergeable yet, mostly because the cpg release based on flatgraph isn't out yet.

WIP flatgraph

1

depends on https://github.com/ShiftLeftSecurity/codepropertygraph/pull/1769