gradle-lint-plugin VS algs4

A little more than two years ago, in October 2019, I began work on my first significant open source project, the Dependency Analysis Gradle Plugin. I had just left a job where I had done relatively little coding, was taking a month off, and wanted to get back into a building mode and learn some new things. I decided to explore the domain of unused-dependency detection. The nearest competitor I was aware of was the Gradle Lint Plugin from the Netflix Nebula collection. However, as that plugin has never supported Android projects, that meant I had an exploitable niche—if only I could exploit it.

Semgrep’s focus is on static analysis/search and is based on rules that developers need to write in a new DSL. Autofix is experimental and is one pattern replaced with another. https://semgrep.dev/docs/experiments/overview/

OpenRewrite originated to do transformations of code, specifically to remove a Netflix proprietary logging library and replace it with in SLF4J. The predecessor of OpenRewrite was Gradle Lint (https://github.com/nebula-plugins/gradle-lint-plugin), commonly used to update Gradle build configuration. OpenRewrite added search after transformation and search can be very flexible (search for all usages of a particular package/any method, not just a specific method invocation). Instead of being DSL based, OpenRewrite provides a set of building blocks called recipes that can be combined together to create more powerful recipes. When building blocks are not enough, you can write a custom recipe in the same language as what you are managing. Java for Java and TypeScript for JavaScript/TypeScript (coming soon).

For example, you can see JUnit 4 to 5 migration recipe contains a set of pre-built and custom recipes.

Also found Gradle Nebula Lint https://github.com/nebula-plugins/gradle-lint-plugin/wiki

Accompanying resources for the Sedgewick and Wayne Algorithms book at https://algs4.cs.princeton.edu/home/. There are quite a number of examples and exercises for you to go through that lean more towards implementation. I usually recommend to at least go through CLRS or your lecture notes before looking at this.

I agreed. CLRS is not beginner friendly and really hard to follow if the reader does not have some background prior to reading the book. Algorithms by Sedgewick is much better, his course on Coursera (although the implementation is in Java) is much more intuitive. Programming Abstraction in C++ is also pretty good.

Algorithms 4th Edition

Try reading this book or any other source available to you.

I recommend Sedgewick’s course and book if you’re serious about it.