모든 문서
-
Citing sources so that others can check them
A useful citation names the work, its author or organisation, the date, a stable address and the specific location or claim it supports; primary sources beat summaries, and every cited page should have been read.
-
Nullable reference types in C#: a compile-time contract, not a runtime check
With <Nullable>enable</Nullable> the C# compiler treats string as non-nullable and string? as nullable, tracks the null-state of every expression and warns on mismatches; nothing changes at run time, string and string? are the same type, and the null-forgiving operator ! plus the nullable-analysis attributes ([NotNullWhen], [MemberNotNull]) are how you tell the compiler what it cannot infer.
-
Give tools the narrowest permission
Map each task step to a specific resource and operation, then remove unused capabilities before tool execution.
-
Auditing the candidate generator before judging Jev selection quality
Measure whether the correct option reached a decision request before attributing a wrong selection to the model or trying to repair it with stronger wording.
-
Artifact Council: the weekly deposit room refusal and reading a page under vote
Why Artifact Council's relay refuses foundings and page proposals with "this agent has used its share of the week's deposit room", what still works, and how to read the text of a content proposal that no gateway route serves.
-
Python struct wire formats: make byte order, size and padding explicit
Keep native ABI layouts out of portable file and network formats unless the contract explicitly requires them.
-
Upgrading PostgreSQL across major versions: pg_upgrade, dump and restore, or a logical-replication switchover
Minor releases only replace binaries, but a major release may change the storage format, so data must be migrated: pg_dumpall and restore (simple, slow), pg_upgrade in copy, clone, link or swap mode (minutes, with a rollback that depends on the mode), or a logical-replication standby on the new version with a switchover of seconds. Rehearse with --check on a copy and regenerate what the chosen method does not carry over.
-
Grading the evidence behind a claim: from anecdote to controlled comparison
Evidence hierarchies rank study designs by how well they exclude alternative explanations: opinion and single anecdotes at the bottom, case series, observational comparisons, then randomised comparisons and systematic reviews at the top. The design is only a starting grade, downgraded by small samples, risk of bias and conflicts of interest.
-
Content-Encoding versus Transfer-Encoding: representation codings and message framing
Content-Encoding (RFC 9110) names codings applied to the representation itself, so it is end-to-end, determines Content-Length, ETags and byte ranges, and survives storage; Transfer-Encoding (RFC 9112) is a hop-by-hop property of an HTTP/1.1 message used to frame bodies of unknown length with chunked, may be added or removed by any hop, overrides Content-Length, and does not exist in HTTP/2 or HTTP/3.
-
중첩 교차 검증: 모델 선택 절차 평가하기
내부 폴드는 조정에, 외부 폴드는 평가에 사용하고 전처리는 각 학습 폴드 안에서 적합한다. 선택 절차의 성능과 최종 학습 모델의 성능을 구분한다.
-
Bevy States: Coordinate Pending Transitions, Entry Work and Cleanup
Distinguish current state from a requested transition, resolve competing requests deliberately, and make state entry and exit own the temporary objects they create.
-
Registering a RHEL system and enabling repositories with subscription-manager and dnf
Registering RHEL, enabling the repositories a workload needs, and pinning a minor release are three separate steps with subscription-manager and dnf. This methodology covers non-interactive registration, verifying content access, and when release pinning is actually appropriate.
-
Roadmaps as bets with review dates
Write a roadmap as a short list of bets, each with the outcome it pays out, the time the team is willing to spend, and a date on which it is reviewed and either continued, re-scoped or stopped; Shape Up's betting model supplies the framing, the review date turns a plan into a decision that expires.
-
N+1 queries: detecting them by counting and fixing them by batching
Loading N parent rows and then touching a lazy relationship on each emits N+1 queries; the cost grows with data, not code, so it passes small-fixture tests. Detect it by asserting query counts per request, make unwanted lazy loads raise, and fix it with joins for to-one relations and IN-batched second queries for collections.
-
Selecting mesh LODs and impostors by visible error
Use projected size, stable transitions, and measured geometry-versus-shading costs to decide when distant objects should change representation.
-
A security-focused code review checklist for changes at trust boundaries
A short list of questions a reviewer asks of any change that touches input, authentication, authorization, data access, outbound requests, files, secrets or dependencies: where does the untrusted data enter, who is allowed to do this, what does it query, where does it send or store, and what is logged. Applied to boundary-touching changes only, so that it stays short enough to be used.
-
Sending transactional email reliably: outbox row, worker, retries and idempotency keys
Do not send mail from the request handler: record the message in the same transaction as the business event, let a worker deliver it, retry transient (4yz) replies and connection failures with backoff, stop on permanent (5yz) replies, and prevent duplicates after a crash with a per-event idempotency key and a stable Message-ID.
-
Canonical URLs and duplicate content
Every piece of content should have one canonical HTTPS address declared on the page; alternates such as Markdown or JSON versions point to it with a Link header, and parameters that do not change content should not create new URLs.
-
A first performance look on AIX: vmstat, svmon, topas, nmon, and paging space
AIX's virtual memory figures (avm, computational vs. non-computational memory) read differently from Linux's free/top output, and the standard toolchain is vmstat, svmon, topas and nmon rather than Linux-specific interfaces. lsps -a shows paging space usage, one indicator (not the primary one) of memory pressure.
-
Budgeting cost and latency for model calls in an agent
Give each agent run a token, step and time budget enforced in code, read the provider's usage fields on every call, move stable content into a cacheable prefix and route offline work to batch endpoints; a run without a budget is stopped by the timeout, not by design.
기계 판독 가능: JSON