I just published a Knowledge Base Article that shows how to manage date/time stamp metadata and use them on the X-Axis of your time history plots. Check it out here: https://lnkd.in/gAz2Hhre HBK - Hottinger Brüel & Kjær / @nCode Software
How to use date/time stamp metadata in time history plots
More Relevant Posts
-
✅ Claude Code by Anthropic now supports subagents. Think of them as tiny Claude instances tuned for tasks like debugging, code review, or database inspection. Here’s a quick look at setting up a NextJs debugging subagent inside your dev workflow with Brandon Mathis. https://lnkd.in/eiAbB_Ri
To view or add a comment, sign in
-
Day 54 of 365 of Solving LeetCode Problems! ✅ Add 2 Numbers in Linked List: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. Key Observations: 1)The key insight is to use a dummy node as a placeholder when constructing the result list. 2)Start with a dummy node (value = -1) and initialize a carry variable = 0. 3)Traverse both lists using a while loop, computing sum = carry + l1->data + l2->data. 4)Insert a new node with value sum % 10 into the result list, and update carry = sum / 10. 5)After traversal, if carry is non-zero, append one final node with that value.
To view or add a comment, sign in
-
-
In your company you might have strict quality criteria for you software components. Something like test coverage must be >= 80% and static code analysis does not find any blocker or critical issues. But your software components typically use some open-source libraries and these libraries use another libraries and so on. You might end up having tens or even hundreds of libraries as dependencies for you software component. But you never perform any due diligence on all of those dependent libraries. Their test coverage might non-existent or low. They don't pass the same static code analysis you perform on your own software component. They simply trust the 3rd party code is good enough. Probably because it can have a large user base which might signify that most bugs are found and already corrected.
To view or add a comment, sign in
-
Context baby. It’s all about the context. Someone’s starting a walk-through of software. They load up their IDE to start & part of a script is immediately shown on screen. Within 5 seconds you declare, “Well that’s not needed. You should be using a docker-compose file”. What might be missing here. Any ideas? 😉
To view or add a comment, sign in
-
In the world of software development, efficiency and simplicity often go hand in hand. Enter sj.h—a tiny JSON parsing library written in C99, clocking in at just 150 lines of code. This project is designed for developers who need a lightweight, zero-allocation solution for parsing JSON without the bloat. It’s ideal for embedded systems, real-time applications, or any scenario where performance and memory usage are critical. sj.h provides clear error messages with line and column information, making debugging straightforward. While it leaves string and number parsing to the developer, this flexibility allows for custom handling of Unicode or numeric formats. Whether you're working on a small project or optimizing an existing system, sj.h offers a clean and efficient way to handle JSON. Learn more and see how it can fit into your workflow.
To view or add a comment, sign in
-
-
If you use ScanCodeIO (https://lnkd.in/eDd4ep66) or SupplyShield (https://lnkd.in/eYXsRaiB) to track your dependencies, you can quickly search your entire db for the affected npm packages or similar: (full query in comments) SELECT * FROM public.scanpipe_discoveredpackage sd WHERE sd.name ILIKE '%duckdb%' AND sd.VERSION ILIKE '%1.3.3%' UNION SELECT ... Don't forget to create pg_trgm indices to make these lookups faster !
To view or add a comment, sign in
-
C++ has been the backbone of high-performance software for decades, but the focus is shifting towards safety. Join John Lakos, a senior architect at Bloomberg and renowned author, as he explores C++'s evolution towards safety-first development. In his talk titled “What C++ Needs to be Safe?”, John will discuss functional, language, memory, lifetime, and data-race safety considerations, and present a roadmap for C++26 and beyond 🚀 🕓 John’s talk will run for 90 minutes. ⚡ This marks the grand return of John Lakos to code::dive - his last appearance was in 2017. For those interested, we are sharing his previous talk from those years: https://lnkd.in/ehaGvYAN 👉 Learn more: https://lnkd.in/ePnAdQi6 #Cpps #SoftwareDevelopment #JohnLakos
To view or add a comment, sign in
-
-
“Anyone who’s pushed real software to production knows that getting code to compile, pass tests, and run reliably in the wild is a far tougher slog than generating the code in the first place.” -- Matt Asay
To view or add a comment, sign in
-
Vibe Coding: Letting LLMs Take the Wheel ⚙️ Andrej Karpathy popularized the term vibe coding — a loose, experimental way of building software using LLMs: * You provide high-level goals in natural language. * The model writes the code; you iterate, test, and refine through feedback loops. * The human shifts from coding line-by-line to guiding, verifying, and problem-solving. Karpathy suggests that LLMs should be seen like operating systems: * They manage context, processing, and interface interactions. * Developers now build on top of an LLM’s “mind,” similar to how applications are built on operating systems resources: https://lnkd.in/eRD8kdtc https://lnkd.in/eNxPeMnX bonus: https://lnkd.in/eZeviJXW
Andrej Karpathy: Software Is Changing (Again)
https://www.youtube.com/
To view or add a comment, sign in
-
Day 51 of 365 of Solving LeetCode Problems! ✅ Remove Nth Node from the end : Given the head of a linked list, remove the nth node from the end of the list and return its head. Key Observations: 1. Use two pointers – one moves fast, the other moves slow. 2. Move the fast pointer n steps ahead first. 3. Then move both pointers together until the fast one reaches the end. 4. At this point, the slow pointer will be just before the node we need to delete. 5. Adjust the links to skip that node, and free up memory. 6. Edge case: if the node to delete is the first one, just return the second node as the new head.
To view or add a comment, sign in
-
Product Management
3wYou're on 🔥