SShortSingh.
Back to feed

Beginner Guide to Ovie's oya Keyword for Immutable Declarations

0
·3 views

The guide introduces oya, the immutable declaration keyword in the Ovie programming language, and explains what immutability means using a permanent-marker analogy. It contrasts oya with mut, which allows values to be reassigned. Examples include a simple hello program and constants such as APP_NAME. A table outlines when to choose oya versus mut, such as constants and fixed labels versus counters and user input. The recommended default is to start with oya and switch to mut if the compiler reports a reassignment error.

Read the full story at DEV Community

This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)

Log in to join the discussion and vote.

Log in

Related stories

0
ProgrammingDEV Community ·

Private Storage and Signed URLs: A Cost-Aware Delivery Pattern for AI Images

Using private object storage with short-lived signed download URLs is generally the cleanest way to deliver AI-generated images, and a public bucket is not required. The approach separates a user-facing application image ID, which the app authorizes before signing, from an opaque storage key in a private bucket. Signed URLs act as bearer credentials, so the application must check ownership before issuing one rather than signing arbitrary paths. Uploads should be idempotent and commit validated metadata so retries do not create duplicate images. The article argues that cost decisions should model retained bytes, requests, delivery traffic, and operational effort, not just headline storage prices.

0
ProgrammingDEV Community ·

llm-d v1.0 on Kubernetes: KV-Cache Routing, Disaggregation, and Production Readiness

The author evaluates llm-d, an inference gateway that routes LLM requests to backends based on cache locality rather than simple round-robin distribution. llm-d adds inference-aware scheduling around engines such as vLLM and SGLang, using an Endpoint Picker to select backends and coordinating separate prefill and decode stages in disaggregated serving. The review identifies three separate decisions: cache-aware routing, flow control, and prefill/decode disaggregation, and suggests starting with routing in front of an existing replicated vLLM deployment. The assessment is a source-backed architecture and deployment review, not a completed benchmark, as the author did not execute the installation or reproduce the cited performance runs. The article also recommends recording version provenance from the release-1.0 branch and includes a preparation script that clones the repository without installing anything into a cluster.

0
ProgrammingDEV Community ·

Five Ways to Cut Voice AI Costs Without Sacrificing Audio Quality

Developers building voice-enabled apps such as podcast generators, IVR systems, and audiobook tools often run into rising text-to-speech bills, since providers typically charge per character, request, or second of audio. The article recommends matching each use case to an appropriate voice tier, using lighter standard models for short, repetitive prompts and premium models where listeners expect high fidelity. It also suggests batching multiple sentences into a single API request to reduce call overhead and character charges. Caching frequently repeated phrases locally or on a CDN, keyed by a hash of the text and voice settings, is presented as another way to avoid paying for the same audio twice. The piece includes Python and Node.js code examples illustrating these techniques.

0
ProgrammingDEV Community ·

eBPF Tutorial Part 8: Monitoring Process Exits and Output via Ring Buffer

This eighth installment of an eBPF tutorial series covers tracing process exit events in the Linux kernel. It introduces the eBPF ring buffer, added in Linux 5.8, as a successor to the perf buffer for sending data from kernel to user space. The article explains that the ring buffer addresses the perf buffer's memory overhead and event reordering problems while keeping support for variable-length records and epoll notifications. The tutorial then walks through a practical example, defining shared header and BPF source files that hook the sched_process_exit tracepoint and skip thread exits. The ring buffer approach follows the same general steps as the perf buffer for printing output to user space.