From aefa4463824bd6d85cb71b9e293b62b0b7fa3a3d Mon Sep 17 00:00:00 2001
From: tag-dbot <128751972+tag-dbot@users.noreply.github.com>
Date: Wed, 20 Nov 2024 16:53:48 +0000
Subject: [PATCH] Update potential-pitfalls-in-data-and-task-parallelism.md

Removes reference to 'cust.Orders' from pitfalls section, as it appears to have been copied from https://learn.microsoft.com/en-us/dotnet/standard/parallel-programming/potential-pitfalls-with-plinq#avoid-over-parallelization and doesn't apply to this document
---
 .../potential-pitfalls-in-data-and-task-parallelism.md          | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/standard/parallel-programming/potential-pitfalls-in-data-and-task-parallelism.md b/docs/standard/parallel-programming/potential-pitfalls-in-data-and-task-parallelism.md
index 77abe37b362ca..496f06900952a 100644
--- a/docs/standard/parallel-programming/potential-pitfalls-in-data-and-task-parallelism.md
+++ b/docs/standard/parallel-programming/potential-pitfalls-in-data-and-task-parallelism.md
@@ -31,7 +31,7 @@ In many cases, <xref:System.Threading.Tasks.Parallel.For%2A?displayProperty=name
   
 - You are performing an expensive computation on each order. (The operation shown in the example is not expensive.)  
   
-- The target system is known to have enough processors to handle the number of threads that will be produced by parallelizing the query on `cust.Orders`.  
+- The target system is known to have enough processors to handle the number of threads that will be produced by parallelizing the processing.  
   
  In all cases, the best way to determine the optimum query shape is to test and measure.