Sep 17, 2026 – Sep 23, 2026

Added edmonds_blossom_algorithm.py. For maximum matching in the graph. #12043Python · 267 + / 0 −

Introduces 9 new declarations in graphs/edmonds_blossom_algorithm.py.

Adds new core implementation rather than adjusting what was there. Tests changed with it, with code of their own.

graphs/edmonds_blossom_algorithm.py ↗ · 3 files

@@ -0,0 +1,267 @@+from collections import deque+++class BlossomAuxData:+    """Class to hold auxiliary data during the blossom algorithm's execution."""++    def __init__(+        self,+        queue: deque,+        parent: list[int],+        base: list[int],+        in_blossom: list[bool],+        match: list[int],+        in_queue: list[bool],+    ) -> None:+        """+        Initializes the BlossomAuxData instance.++        Args:+            queue: A deque for BFS processing.+            parent: List of parent vertices in the augmenting path.+            base: List of base vertices for each vertex.+            in_blossom: Boolean list indicating if a vertex is in a blossom.+            match: List of matched vertices.+            in_queue: Boolean list indicating if a vertex is in the queue.+        """+        self.queue = queue+        self.parent = parent+        self.base = base+        self.in_blossom = in_blossom+        self.match = match+        self.in_queue = in_queue+

core/validation: keep stored ResourceQuota values out of update checksGo · 37 + / 19 −

Introduces 3 new declarations in pkg/apis/core/validation/validation.go.

Adds new systems design rather than adjusting what was there. Tests changed with it, with code of their own.

pkg/apis/core/validation/validation.go ↗ · 2 files

@@ -8528,21 +8528,48 @@ func ValidateResourceQuotaStatus(status *core.ResourceQuotaStatus, fld *field.Pa }  func ValidateResourceQuotaSpec(resourceQuotaSpec *core.ResourceQuotaSpec, fld *field.Path) field.ErrorList {+	return validateResourceQuotaSpec(resourceQuotaSpec, nil, fld)+}++// validateResourceQuotaSpec validates a spec against the hard limits the object+// already stores, oldHard, which is nil on create. Nothing is mutated.+func validateResourceQuotaSpec(resourceQuotaSpec *core.ResourceQuotaSpec, oldHard core.ResourceList, fld *field.Path) field.ErrorList { 	allErrs := field.ErrorList{} -	fldPath := fld.Child("hard")-	for k, v := range resourceQuotaSpec.Hard {-		resPath := fldPath.Key(string(k))-		allErrs = append(allErrs, ValidateResourceQuotaResourceName(k, resPath)...)-		allErrs = append(allErrs, ValidateResourceQuantityValue(k, v, resPath)...)-	}+	allErrs = append(allErrs, validateResourceQuotaResourceList(resourceQuotaSpec.Hard, fld.Child("hard"), oldHard)...)  	allErrs = append(allErrs, validateResourceQuotaScopes(resourceQuotaSpec, fld)...) 	allErrs = append(allErrs, validateScopeSelector(resourceQuotaSpec, fld)...)  	return allErrs } +// validateResourceQuotaResourceList validates every name in values, and every+// value that none of the stored lists holds under the same key. Nothing is mutated.+func validateResourceQuotaResourceList(values core.ResourceList, fldPath *field.Path, stored ...core.ResourceList) field.ErrorList {+	allErrs := field.ErrorList{}+	for k, v := range values {+		resPath := fldPath.Key(string(k))+		allErrs = append(allErrs, ValidateResourceQuotaResourceName(k, resPath)...)+		// A value the object already holds was accepted when it was stored.

kubectl explain: add auto completionGo · 265 + / 5 −

Introduces 7 new declarations in staging/src/k8s.io/kubectl/pkg/cmd/explain/completion.go.

Adds new systems design rather than adjusting what was there. Tests changed with it, with code of their own.

staging/src/k8s.io/kubectl/pkg/cmd/explain/completion.go ↗ · 4 files

@@ -0,0 +1,252 @@+/*+Copyright The Kubernetes Authors.++Licensed under the Apache License, Version 2.0 (the "License");+you may not use this file except in compliance with the License.+You may obtain a copy of the License at++    http://www.apache.org/licenses/LICENSE-2.0++Unless required by applicable law or agreed to in writing, software+distributed under the License is distributed on an "AS IS" BASIS,+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.+See the License for the specific language governing permissions and+limitations under the License.+*/++package explain++import (+	"slices"+	"strings"++	"github.com/spf13/cobra"++	"k8s.io/apimachinery/pkg/api/meta"+	"k8s.io/apimachinery/pkg/runtime/schema"+	"k8s.io/cli-runtime/pkg/genericclioptions"+	"k8s.io/client-go/openapi3"+	"k8s.io/kube-openapi/pkg/validation/spec"+	"k8s.io/kubectl/pkg/explain"+	"k8s.io/kubectl/pkg/util/completion"+)+

Add some more verification and safety rules around custom `distDir`TypeScript · 62 + / 0 −

Introduces 3 new declarations in packages/next/src/lib/dist-dir.ts.

Adds new framework internals rather than adjusting what was there. Tests changed with it, with code of their own.

packages/next/src/lib/dist-dir.ts ↗ · 8 files

@@ -0,0 +1,59 @@+import * as path from 'node:path'++export class InvalidDistDirError extends Error {+  constructor(distDir: string, appDir: string, workspaceRoot: string) {+    super(+      `The configured distDir should be inside of the application directory ` ++        `or the workspace containing it, and must not contain the application ` ++        `directory itself:\n\n` ++        `  distDir:        ${distDir}\n` ++        `  application:    ${appDir}\n` ++        `  workspace root: ${workspaceRoot}\n\n` ++        `Read more: https://nextjs.org/docs/messages/invalid-dist-dir`+    )+    this.name = 'InvalidDistDirError'+  }+}++/** Whether `descendant` is strictly inside `ancestor`. */+// TODO: Account for symlinks when validating containment.+function isStrictlyInside(ancestor: string, descendant: string): boolean {+  const relative = path.relative(path.resolve(ancestor), descendant)+  return (+    relative !== '' &&+    relative !== '..' &&+    !relative.startsWith('..' + path.sep) &&+    !path.isAbsolute(relative)+  )+}++/**+ * Throws unless `distDir` is inside the application or workspace, without+ * containing the application itself.+ */

sqlite: add virtual table support via createModule()C++ · 826 + / 0 −

Introduces 7 new declarations in src/node_sqlite.cc.

Adds new runtime rather than adjusting what was there. Tests changed with it, with code of their own.

src/node_sqlite.cc ↗ · 5 files

@@ -1012,6 +1015,483 @@ BaseObjectPtr<DatabaseSyncLimits> DatabaseSyncLimits::Create(   return MakeBaseObject<DatabaseSyncLimits>(env, obj, std::move(database)); } +// ---------------------------------------------------------------------------+// VirtualTableModule+// ---------------------------------------------------------------------------++VirtualTableModule::VirtualTableModule(Environment* env,+                                       BaseObjectWeakPtr<DatabaseSync> db,+                                       Local<Function> rows_fn,+                                       std::string&& schema_sql,+                                       int num_columns,+                                       std::vector<int>&& hidden_col_indices,+                                       bool use_bigint_args,+                                       bool direct_only)+    : env_(env),+      db_(std::move(db)),+      rows_fn_(env->isolate(), rows_fn),+      schema_sql_(std::move(schema_sql)),+      num_columns_(num_columns),+      hidden_col_indices_(std::move(hidden_col_indices)),+      use_bigint_args_(use_bigint_args),+      direct_only_(direct_only),+      module_def_({}) {+  // Initialize the sqlite3_module definition. Each VirtualTableModule instance+  // gets its own copy to avoid thread-safety issues with worker threads.+  module_def_.iVersion = 1;+  module_def_.xCreate = VirtualTableModule::xCreate;+  module_def_.xConnect = VirtualTableModule::xCreate;+  module_def_.xBestIndex = VirtualTableModule::xBestIndex;+  module_def_.xDisconnect = VirtualTableModule::xDisconnect;+  module_def_.xDestroy = VirtualTableModule::xDestroy;+  module_def_.xOpen = VirtualTableModule::xOpen;

Fix startTime and shutdown delivery of forwarded Turbopack trace spansRust · 154 + / 33 −

Introduces 5 new declarations in turbopack/crates/turbo-tasks/src/message_queue.rs.

Adds new framework internals rather than adjusting what was there. Tests changed with it, with code of their own.

turbopack/crates/turbo-tasks/src/message_queue.rs ↗ · 5 files

@@ -59,58 +88,93 @@ impl CompilationEventQueue {                 history.pop_front();             }             history.push_back(message_clone.clone());+            drop(history);++            if deliver {+                // Send to all active receivers of the same message type+                if let Some(mut type_subscribers) = subscribers.get_mut(&EventChannelType::Type(+                    message_clone.type_name().to_owned(),+                )) {+                    let mut removal_indices = Vec::new();+                    for (ix, sender) in type_subscribers.iter().enumerate() {+                        if sender.send(message_clone.clone()).await.is_err() {+                            removal_indices.push(ix);+                        }+                    } -            // Send to all active receivers of the same message type-            if let Some(mut type_subscribers) = subscribers.get_mut(&EventChannelType::Type(-                message_clone.type_name().to_owned(),-            )) {-                let mut removal_indices = Vec::new();-                for (ix, sender) in type_subscribers.iter().enumerate() {-                    if sender.send(message_clone.clone()).await.is_err() {-                        removal_indices.push(ix);+                    for ix in removal_indices.iter().rev() {+                        type_subscribers.remove(*ix);                     }                 } -                for ix in removal_indices.iter().rev() {-                    type_subscribers.remove(*ix);-                }

Always materialize the causal mask in Doge so sdpa stays causalPython · 85 + / 2 −

Introduces 3 new declarations in src/transformers/models/doge/modular_doge.py.

Adds new core implementation rather than adjusting what was there. Tests changed with it, with code of their own.

src/transformers/models/doge/modular_doge.py ↗ · 3 files

@@ -449,7 +450,61 @@ def _init_weights(self, module):   class DogeModel(MixtralModel):-    pass+    def forward(+        self,+        input_ids: torch.LongTensor | None = None,+        attention_mask: torch.Tensor | None = None,+        position_ids: torch.LongTensor | None = None,+        past_key_values: Cache | None = None,+        inputs_embeds: torch.FloatTensor | None = None,+        use_cache: bool | None = None,+        **kwargs: Unpack[TransformersKwargs],+    ) -> MoeModelOutputWithPast:+        if (input_ids is None) ^ (inputs_embeds is not None):+            raise ValueError("You must specify exactly one of input_ids or inputs_embeds")++        if use_cache and past_key_values is None:+            past_key_values = DynamicCache(config=self.config)++        if inputs_embeds is None:+            inputs_embeds = self.embed_tokens(input_ids)++        if position_ids is None:+            past_seen_tokens = past_key_values.get_seq_length() if past_key_values is not None else 0+            position_ids = torch.arange(inputs_embeds.shape[1], device=inputs_embeds.device) + past_seen_tokens+            position_ids = position_ids.unsqueeze(0)++        mask_function = create_causal_mask if self.config.sliding_window is None else create_sliding_window_causal_mask+        causal_mask = mask_function(+            config=self.config,+            inputs_embeds=inputs_embeds,+            attention_mask=attention_mask,

[CB] Add pause mechanismPython · 178 + / 43 −

Introduces 10 new declarations in src/transformers/generation/continuous_batching/continuous_api.py.

Adds new core implementation rather than adjusting what was there. Tests changed with it, with code of their own.

src/transformers/generation/continuous_batching/continuous_api.py ↗ · 4 files

@@ -137,58 +139,77 @@ def fail_and_deliver(self, state: RequestState, error: Exception) -> None:  class BackgroundThreadStatus:     """Tracks the status of the background thread locally and in its TP group. The status is an int that can only-    increase, representing how soon the thread should stop."""+    increase, representing how soon the thread should stop.+    Through this object, threads sharing the model can also pause the generation loop. Any number of threads may ask at+    once, and the loop resumes once they are all done.+    """ +    # Stop statuses, in increasing order of urgency. The local status can only ever increase.     DONT_STOP = 0     FLUSH_AND_STOP = 1     HARD_STOP = 2     STOPPED = 3      def __init__(self) -> None:-        self._local_status_lock = threading.Lock()+        self.fatal_error = None+        self._condition = threading.Condition()         self._local_status = self.DONT_STOP         self._tp_status = self.DONT_STOP-        self.fatal_error = None+        self._pauses_requested = 0+        self._local_pauses_requested = ThreadLocalCounter()+        self._paused = False      def clear(self) -> None:-        """Clear the local and TP statuses. This method should ONLY be called by the main thread itself BEFORE starting-        the background thread."""-        self._tp_status = self.DONT_STOP-        with self._local_status_lock:+        """Clear the statuses and the pause state. This method should ONLY be called by the main thread itself BEFORE+        starting the background thread."""

scheduler: refine SchedulingAlgorithm surface and decouple cache vs snapshot placementGo · 338 + / 192 −

Introduces 16 new declarations in pkg/scheduler/algorithm.go.

Adds new framework internals rather than adjusting what was there. Tests changed with it, with code of their own.

pkg/scheduler/algorithm.go ↗ · 9 files

@@ -447,126 +557,148 @@ func (a *SchedulingAlgorithm) assume(logger klog.Logger, schedFramework framewor 		// Any potential NodeAllocatableResourceClaimStatuses from a previously failed scheduling attempt is overwritten. 		// This field is not explicitly cleared as the Pod object is reconstructed in handleSchedulingFailure() 		// before re-queueing.-		assumedPodInfo.Pod.Status.NodeAllocatableResourceClaimStatuses = dynamicresources.ExtractPodNodeAllocatableResourceClaimStatus(logger, state, host)+		assumedPodInfo.Pod.Status.NodeAllocatableResourceClaimStatuses =+			dynamicresources.ExtractPodNodeAllocatableResourceClaimStatus(logger, state, host) 	}+	return assumedPodInfo+} -	if state.IsPodGroupSchedulingCycle() {-		err := a.nodeInfoSnapshot.AssumePod(assumedPodInfo.PodInfo)-		if err != nil {-			logger.Error(err, "Scheduler snapshot AssumePod failed")-			return err+// reserve runs Reserve plugins for the assumed pod and converts plugin rejections+// into a single-node FitError.+func (a *SchedulingAlgorithm) reserve(ctx context.Context, state fwk.CycleState,+	schedFramework framework.Framework, assumedPodInfo *framework.QueuedPodInfo,+	origPod *v1.Pod, host string) *fwk.Status {+	if status := schedFramework.RunReservePluginsReserve(ctx, state, assumedPodInfo.Pod, host); !status.IsSuccess() {+		if status.IsRejected() {+			fitErr := &framework.FitError{+				NumAllNodes: 1,+				Pod:         origPod,+				Diagnosis: framework.Diagnosis{+					NodeToStatus: framework.NewDefaultNodeToStatus(),+				},+			}+			fitErr.Diagnosis.NodeToStatus.Set(host, status)+			fitErr.Diagnosis.AddPluginStatus(status)+			return fwk.NewStatus(status.Code()).WithError(fitErr) 		}

BUG: named agg result depended on the output name matching the column name (GH#63743)Python · 40 + / 4 −

Introduces 3 new declarations in pandas/core/apply.py.

Adds new core implementation rather than adjusting what was there. Tests changed with it, with code of their own.

pandas/core/apply.py ↗ · 4 files

@@ -1902,10 +1902,22 @@ def reconstruct_func(     names, and the reconstructed order of columns.     If relabeling is False, the columns and order will be None. +    Named aggregation is the one exception: when ``allow_skip_normalization`` is+    True, every output name equals its source column name, and every aggfunc+    reduces to a scalar, relabeling is reported as False (and columns/order as+    None) even though named aggregation was used, because the caller can consume+    the un-normalized func directly.+     Parameters     ----------     func: agg function (e.g. 'min' or Callable) or list of agg functions         (e.g. ['min', np.max]) or dictionary (e.g. {'A': ['min', np.max]}).+    allow_skip_normalization: bool, default False+        Whether the caller can handle the un-normalized ``{column: aggfunc}`` form+        that named aggregation reduces to when every output name equals its source+        column name and every aggfunc is a scalar reduction. Callers that rely on+        ``columns``/``order`` being returned whenever named aggregation was used+        must leave this False.     **kwargs: dict, kwargs used in is_multi_agg_with_relabel and         normalize_keyword_aggregation function for relabelling 

Staticlib rename internal symbols: add COFF supportRust · 183 + / 17 −

Introduces 3 new declarations in compiler/rustc_codegen_ssa/src/back/symbol_edit.rs.

Adds new language design rather than adjusting what was there. Tests changed with it, with code of their own.

compiler/rustc_codegen_ssa/src/back/symbol_edit.rs ↗ · 4 files

@@ -441,6 +476,125 @@ fn macho_rebuild_strtab(     Some(result) } +// ---------------------------------------------------------------------------+// COFF: single-pass collection + apply+// ---------------------------------------------------------------------------++fn coff_collect_impl<'data, Coff: CoffHeader>(+    data: &'data [u8],+    header: &'data Coff,+    exported: &FxHashSet<String>,+    out: &mut FxHashSet<String>,+    strip_underscore: bool,+) {+    let Ok(symbols) = header.symbols(data) else { return };+    let strings = symbols.strings();++    for (_index, sym) in symbols.iter() {+        let sclass = sym.storage_class();+        if sclass != pe::IMAGE_SYM_CLASS_EXTERNAL && sclass != pe::IMAGE_SYM_CLASS_WEAK_EXTERNAL {+            continue;+        }+        if sym.section_number() <= 0 {+            continue;+        }+        let Ok(name_bytes) = sym.name(strings) else { continue };+        let Ok(mut name) = str::from_utf8(name_bytes).map(String::from) else { continue };+        if strip_underscore {+            name = name.strip_prefix('_').unwrap_or(&name).to_string();+        }+        if !exported.contains(&name) {+            out.insert(name);+        }

Complex conjugate, negation and defaultRust · 37 + / 2 −

Introduces 7 new declarations in library/core/src/num/complex.rs.

Adds new language design rather than adjusting what was there. Tests changed with it, with code of their own.

library/core/src/num/complex.rs ↗ · 2 files

@@ -16,11 +16,46 @@ pub struct Complex<T> { impl<T> Complex<T> {     /// Create a new complex number from a real and imaginary component.     #[must_use]-    pub fn new(re: T, im: T) -> Complex<T> {+    pub const fn new(re: T, im: T) -> Complex<T> {         Complex { re, im }     } } +#[unstable(feature = "complex_numbers", issue = "154023")]+impl<T: Default> Default for Complex<T> {+    fn default() -> Self {+        Self { re: Default::default(), im: Default::default() }+    }+}++#[unstable(feature = "complex_numbers", issue = "154023")]+impl<T> Complex<T>+where+    T: Neg<Output = T>,+{+    /// The complex conjugate of a complex number.+    ///+    /// The conjugate of `a + bi` is `a - bi`: the imaginary component is negated.+    /// Geometrically, this is a reflection across the real axis.+    #[must_use]+    pub fn conjugate(self) -> Self {+        Complex { re: self.re, im: -self.im }+    }+}++#[unstable(feature = "complex_numbers", issue = "154023")]+impl<T: Neg> Neg for Complex<T> {