From 15000b4da791bdded3b0e2ffcfcd0e0a05c4feeb Mon Sep 17 00:00:00 2001
From: cxl <cxl@f0d560ea-af0d-0410-9eb7-867de7ffcac7>
Date: Thu, 7 Jan 2016 13:27:55 +0000
Subject: [PATCH] .docs

git-svn-id: svn://ultimatepp.org/upp/trunk@9372 f0d560ea-af0d-0410-9eb7-867de7ffcac7
---
 uppsrc/Core/src.tpp/SpinLock$en-us.tpp | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/uppsrc/Core/src.tpp/SpinLock$en-us.tpp b/uppsrc/Core/src.tpp/SpinLock$en-us.tpp
index 3e2d51d19..36e7690d8 100644
--- a/uppsrc/Core/src.tpp/SpinLock$en-us.tpp
+++ b/uppsrc/Core/src.tpp/SpinLock$en-us.tpp
@@ -16,10 +16,11 @@ topic "SpinLock";
 oveable][3 <][*3 SpinLock][3 >_]&]
 [s2;%% Lightweight busywaiting synchronization lock. Unlike Mutex, 
 SpinLock waits in a loop until resource becomes available, thus 
-avoiding costs of system call at the price of active wating. 
-SpinLock methods are also usually inlined (and trivial). SpinLock 
-is [* not] reentrant and also [* not] fair (if more threads are waiting 
-on the same SpinLock, the order of acquiring it is not specified).&]
+avoiding costs of contention system context switch at the price 
+of active waiting. SpinLock methods are also usually inlined 
+(and trivial). SpinLock is [* not] reentrant and also [* not] fair 
+(if more threads are waiting on the same SpinLock, the order 
+of acquiring it is not specified).&]
 [s3; &]
 [ {{10000F(128)G(128)@1 [s0;%% [* Public Method List]]}}&]
 [s3; &]