Focused on hardcore practical AI technologies (OpenClaw, ClaudeCode, LLMs, etc.) and HarmonyOS development. No hype—just real-world tips, pitfall chronicles, and productivity tools. Follow to transform workflows with code.
This article walks through Android’s Activity.setContentView implementation, tracing how the framework creates a PhoneWindow, initializes a DecorView, selects the appropriate layout resource, inflates it, and finally attaches the view hierarchy to the activity’s content container.
This article introduces dynamic programming as an optimization technique from operations research, explains its fundamental concepts, optimality principle, no‑after‑effect property, and overlapping subproblems, outlines the typical problem‑model steps, and demonstrates a practical C++ implementation for solving the fractional knapsack problem.
This article explains what RemoteViews are, their use cases in notification bars and home‑screen widgets, provides step‑by‑step code for both scenarios, details PendingIntent handling, and dives deep into the internal cross‑process mechanisms that power RemoteViews updates.
This article explains why thread safety is essential in concurrent Java programs, introduces the lock concept, and provides detailed examples of using the synchronized keyword to protect code blocks, instance methods, static methods, and entire classes, including common pitfalls and inheritance rules.
This article explains Android's Handler and Looper mechanism, shows why creating a Handler in a non‑Looper thread triggers a RuntimeException, and walks through the relevant source code—including Handler constructors, Looper.myLooper(), ThreadLocal operations, and the required Looper.prepare() call.
This tutorial walks through the principles of Android hotfixing, explains class loaders, and provides a complete hands‑on implementation—including a buggy class, a custom Dex loader, patch creation, and runtime injection—so developers can quickly patch bugs without releasing a full app update.
This article explains the core idea of greedy algorithms, outlines their basic workflow, identifies problem types where they apply, presents a generic greedy framework, demonstrates a fractional knapsack implementation in C++, and lists several classic greedy problems with brief solutions.
