Hub · Weitere Werkzeuge

Datenvertragswerk

202 veröffentlichte Endpunkt-URLs. Methoden, Preise, Eingaben und Originaldokumentation auf jeder Detailseite.

datenvertrag.halowerk.com · Katalogstand 2026-11-07, 02:42 UTC

Endpunkte

181–202 von 202

Datenvertragswerk0,003 USDC
simultaneous core partition family
POSThttps://datenvertrag.halowerk.com/v1/simultaneous-core-partition-family
For supplied coprime positive integers a,b each1..5, synthesize EVERY simultaneous(a,b)-core integer partition: no cell hook length is divisible by either parameter. No original partition is supplied. Return all nonincreasing positive rowle
Datenvertragswerk0,003 USDC
snapshot window collision plan
POSThttps://datenvertrag.halowerk.com/v1/snapshot-window-collision-plan
Check which buffered snapshot READ keys may remain after a supplied Debezium-style chunk window so a data consumer does not reapply superseded snapshot rows. Normalized one-chunk metadata only;no connector,SQL call or full-table truth. Miss
Datenvertragswerk0,003 USDC
stable cartesian tree reconstruction audit
POSThttps://datenvertrag.halowerk.com/v1/stable-cartesian-tree-reconstruction-audit
From1..24 supplied integer values construct the unique min-Cartesian tree with priority(value,originalindex), inorder0..n-1. Return every parent/left/right/root, half-open subtree range and inclusive-endpoint range-argmin triangular table.
Datenvertragswerk0,003 USDC
stable matching family inventory
POSThttps://datenvertrag.halowerk.com/v1/stable-matching-family-inventory
For two equal sets0..n-1,n0..5, with complete strict partner-preference permutations, synthesize ALL stable full bijections. A blocking pair strictly prefers each other to their assigned partners. Return every left-indexed partner vector in
Datenvertragswerk0,003 USDC
stack sort preimage inventory
POSThttps://datenvertrag.halowerk.com/v1/stack-sort-preimage-inventory
Given a target permutation of0..n-1,n0..7, reconstruct ALL source permutations mapped to it by one deterministic stack-sort pass: while top<next input pop to output, then push input; drain after finalinput. Return every source in numeric le
Datenvertragswerk0,003 USDC
standard tableau evacuation ledger
POSThttps://datenvertrag.halowerk.com/v1/standard-tableau-evacuation-ledger
For one English-convention straight standard Young tableau with0..8cells labelled1..n exactlyonce, construct its Schuetzenberger evacuation. Repeatedly remove1, slide smaller existingright/below neighbor intohole tooutercorner, deletecorner
Datenvertragswerk0,003 USDC
standard tableau promotion orbit ledger
POSThttps://datenvertrag.halowerk.com/v1/standard-tableau-promotion-orbit-ledger
For one straight standard Young tableau with0..8cells labelled1..n, iterate the explicit remove-minimum promotion direction: remove1, slide smaller right/below neighbor into hole until outer corner, put n+1 there, subtract1 throughout. Retu
Datenvertragswerk0,003 USDC
stirling permutation index ledger
POSThttps://datenvertrag.halowerk.com/v1/stirling-permutation-index-ledger
For original order n0..6, each label1..n occurs exactlytwice and EVERY value between equalcopies i must exceed i. Rank supplied whole word in numericlexicographic order among ONLY these Stirling permutations and independently decode supplie
Datenvertragswerk0,003 USDC
strong orientation family
POSThttps://datenvertrag.halowerk.com/v1/strong-orientation-family
For a fully captured simple undirected graph on1..4 original labels0..n-1, construct ALL orientations in which every vertex can reach every other by directed paths. Return lexicographically sorted edge_order(u<v), ascending orientation_mask
Datenvertragswerk0,003 USDC
subsequence deck word reconstruction family
POSThttps://datenvertrag.halowerk.com/v1/subsequence-deck-word-reconstruction-family
Given original length n in0..8, k in0..n and a full k-deck as distinct binaryword/count entries, reconstruct EVERY binary n-word whose multiset of all length-k subsequences equals that deck exactly. Subsequences preserve order and allow gap
Datenvertragswerk0,003 USDC
substring endpos automaton ledger
POSThttps://datenvertrag.halowerk.com/v1/substring-endpos-automaton-ledger
For0..32numeric tokens0..2, reconstruct allnonempty substringendpos-equivalence classes plusroot, sortedby(maxlength,longestrepresentative). Return allstate lengthintervals/representatives/endpositions/suffixlinks/transitions/suffixterminal
Datenvertragswerk0,003 USDC
trace monoid foata normalization
POSThttps://datenvertrag.halowerk.com/v1/trace-monoid-foata-normalization
Given original generator word and an explicit symmetric irreflexive independence relation, reconstruct its entire Cartier-Foata normal form, occurrence-indexed heights, all forward dependence edges and lexicographically least word in the ad
Datenvertragswerk0,003 USDC
transaction fragment rank audit
POSThttps://datenvertrag.halowerk.com/v1/transaction-fragment-rank-audit
Check a supplied multi-collection CDC transaction fragment set against END event counts and coupled global/per-collection ordinal positions before downstream assembly. Caller groups normalized fragments first;raw BEGIN/END IDs are never inf
Datenvertragswerk0,003 USDC
tree centroid branch ledger
POSThttps://datenvertrag.halowerk.com/v1/tree-centroid-branch-ledger
For a supplied simple connected undirected tree on1..32vertices labelled0..n-1, return a complete per-vertex deletion ledger:each adjacent neighbor in ascending order and the remaining component size reached through it,largest component,min
Datenvertragswerk0,003 USDC
tunstall optimal phrase dictionary family
POSThttps://datenvertrag.halowerk.com/v1/tunstall-optimal-phrase-dictionary-family
For supplied positive binary symbol weights[weight0,weight1] each1..4 and exact leafcount2..7, construct ALL full binary prefix phrase dictionaries maximizing expected consumed source symbols per phrase. Model independent identically distri
Datenvertragswerk0,003 USDC
two rate three color ledger
POSThttps://datenvertrag.halowerk.com/v1/two-rate-three-color-ledger
Own bounded RFC2698 Informational trTCM replay. Full buckets at time0; integer-second normalized packet events and supplied IP-byte lengths; independent peak/committed refill and color-aware or blind marking. Return every interpreted mark,
Datenvertragswerk0,003 USDC
two square lattice shell inventory
POSThttps://datenvertrag.halowerk.com/v1/two-square-lattice-shell-inventory
For an integer norm from 0 to 1024, return every ordered signed integer pair (x,y) satisfying x*x+y*y=norm, sorted by x then y. Partition points by sign changes and coordinate exchange, with canonical nonnegative representative a<=b; return
Datenvertragswerk0,003 USDC
unmatched component retraction ledger
POSThttps://datenvertrag.halowerk.com/v1/unmatched-component-retraction-ledger
Audit the signed retraction/restoration ledger of structurally unmatched left tuples when supplied left/right bag changes cross the zero-match boundary, before applying a materialized-view delta. Only structural unmatched-extension coeffici
Datenvertragswerk0,003 USDC
vertex deck reconstruction family
POSThttps://datenvertrag.halowerk.com/v1/vertex-deck-reconstruction-family
From n0..5 and a complete multiset of exactlyn unlabelled (n-1)-vertex graphcards, construct ALL labelled simple undirected graphs on0..n-1 with that vertex-deleted deck. Graphcode is adjacencybitmask for unorderedpairs(0,1),(0,2),. lexicog
Datenvertragswerk0,003 USDC
wavelet matrix rank select audit
POSThttps://datenvertrag.halowerk.com/v1/wavelet-matrix-rank-select-audit
Construct the complete four-level wavelet matrix for an original0..64item sequence of numeric symbols0..15. Return levelbitmaps, prefixonecounts, zero_counts, stable original-index witnesses, finalpermutation/values and up to8prefixrank plu
Datenvertragswerk0,003 USDC
window signed digit recoding audit
POSThttps://datenvertrag.halowerk.com/v1/window-signed-digit-recoding-audit
For an anonymous supplied integer(-2147483647..2147483647) and width2..8 reconstruct the entire canonical window nonadjacent signed binary expansion. Return little-endian signed digits, all nonzero positions/count and per-bit exact before/d
Datenvertragswerk0,003 USDC
word shuffle coefficient family
POSThttps://datenvertrag.halowerk.com/v1/word-shuffle-coefficient-family
For two supplied binary words of length0..4, construct their full non-overlapping shuffle product: every length-additive word preserving each original as an ordered subsequence, with exact number of left/right interleavings producing it. So