Spelling and markdown issues

Author: Colin Robertson

docs/parallel/amp/reference/accelerator-class.md

@@ -472,7 +472,7 @@ The path to the accelerator.
 
 ## <a name="set_default_cpu_access_type"></a> set_default_cpu_access_type
 
-Set the default cpu access_type for arrays created on this accelerator or for implicit memory allocations as part of array_views accessed on this accelerator. This method only succeeds if the default_cpu_access_type for the accelerator has not already been overriden by a previous call to this method and the runtime selected default_cpu_access_type for this accelerator has not yet been used for allocating an array or for an implicit memory allocation backing an array_view accessed on this accelerator.
+Set the default cpu access_type for arrays created on this accelerator or for implicit memory allocations as part of array_views accessed on this accelerator. This method only succeeds if the default_cpu_access_type for the accelerator has not already been overridden by a previous call to this method and the runtime selected default_cpu_access_type for this accelerator has not yet been used for allocating an array or for an implicit memory allocation backing an array_view accessed on this accelerator.
 
 ```cpp
 bool set_default_cpu_access_type(access_type _Default_cpu_access_type);

docs/parallel/amp/reference/array-class.md

@@ -398,7 +398,7 @@ The next-to-most-significant component of the extent of this section.
 The least significant component of the extent of this section.
 
 *_InputIterator*<br/>
-The type of the input interator.
+The type of the input iterator.
 
 *_Src*<br/>
 To object to copy.

docs/parallel/amp/reference/array-view-class.md

@@ -552,7 +552,7 @@ An `array_view` object or a const `array_view` object that is based on this `arr
 
 Sometimes it is convenient to view a multi-dimensional array as a linear, one-dimensional array, which may have a different value type than the source array. You can achieve this on an `array_view` by using this method.
 
-**Warning** Reinterpeting an array_view object by using a different value type is a potentially unsafe operation. This functionality should be used with care.
+**Warning** Reinterpreting an array_view object by using a different value type is a potentially unsafe operation. This functionality should be used with care.
 
 Here's an example:
 

docs/parallel/amp/reference/concurrency-graphics-namespace-functions.md

@@ -126,7 +126,7 @@ The type of the destination object.
 The offset into the destination at which to begin copying.
 
 *InputIterator*<br/>
-The type of the input interator.
+The type of the input iterator.
 
 *OutputIterator*<br/>
 The type of the output iterator.
@@ -261,7 +261,7 @@ The type of the destination object.
 The offset into the destination at which to begin copying.
 
 *InputIterator*<br/>
-The type of the input interator.
+The type of the input iterator.
 
 *OutputIterator*<br/>
 The type of the output iterator.

docs/parallel/amp/reference/concurrency-namespace-functions-amp.md

@@ -31,7 +31,7 @@ A `tile_barrier` object.
 
 ## <a name="amp_uninitialize"></a>  amp_uninitialize
 
-Uninitializes the C++ AMP runtime. It is legal to call this function multiple times during an applications lifetime. Calling any C++ AMP API afer calling this function will reinitialize the C++ AMP runtime. Note that it is illegal to use C++ AMP objects across calls to this function and doing so will result in undefined behavior. Also, concurrently calling this function and any other AMP APIs is illegal and would result in undefined behavior.
+Uninitializes the C++ AMP runtime. It is legal to call this function multiple times during an applications lifetime. Calling any C++ AMP API after calling this function will reinitialize the C++ AMP runtime. Note that it is illegal to use C++ AMP objects across calls to this function and doing so will result in undefined behavior. Also, concurrently calling this function and any other AMP APIs is illegal and would result in undefined behavior.
 
 ```cpp
 void __cdecl amp_uninitialize();
@@ -94,7 +94,7 @@ inline float atomic_exchange(
 ### Parameters
 
 *_Dest*<br/>
-Pointer to the destionation location.
+Pointer to the destination location.
 
 *value*<br/>
 The new value.
@@ -301,7 +301,7 @@ inline unsigned int atomic_fetch_sub(
 ### Parameters
 
 *_Dest*<br/>
-Pointer to the destionation location.
+Pointer to the destination location.
 
 *value*<br/>
 The value to be subtracted.
@@ -312,7 +312,7 @@ The original value of the memory location.
 
 ## <a name="atomic_fetch_xor"></a>  atomic_fetch_xor Function (C++ AMP)
 
-Atomically peforms an bitwise XOR operation of a value and a memory location.
+Atomically performs an bitwise XOR operation of a value and a memory location.
 
 ```cpp
 inline int atomic_fetch_xor(
@@ -415,7 +415,7 @@ The object to copy to.
 An output iterator to the beginning position at destination.
 
 *InputIterator*<br/>
-The type of the input interator.
+The type of the input iterator.
 
 *OutputIterator*<br/>
 The type of the output iterator.
@@ -504,7 +504,7 @@ The object to copy to.
 An output iterator to the beginning position at destination.
 
 *InputIterator*<br/>
-The type of the input interator.
+The type of the input iterator.
 
 *OutputIterator*<br/>
 The type of the output iterator.

docs/parallel/amp/reference/extent-class.md

@@ -125,7 +125,7 @@ An `extent` object on which the new `extent` object is based.
 
 ## Remarks
 
-The parameterless constructor initializes an `extent` object that has a rank of three.
+The default constructor initializes an `extent` object that has a rank of three.
 
 If an array is used to construct an `extent` object, the length of the array must match the rank of the `extent` object.
 

docs/parallel/amp/reference/index-class.md

@@ -7,7 +7,7 @@ ms.assetid: cbe79b08-0ba7-474c-9828-f1a71da39eb3
 ---
 # index Class
 
-Defines an *N*-dimensional index pographics-cpp-amp.md.
+Defines an *N*-dimensional index vector.
 
 ## Syntax
 
@@ -117,6 +117,7 @@ An index object on which the new index object is based.
 ## <a name="operator--"></a>  operator--
 
 Decrements each element of the index object.
+
 ```cpp
 index<_Rank>& operator--() restrict(amp,cpu);
 
@@ -145,11 +146,13 @@ index<_Rank>& operator%=(
 The number to divide by to find the modulus.
 
 ## Return Value
+
 The index object.
 
 ## <a name="operator_star_eq"></a>  operator*=
 
 Multiplies each element in the index object by the specified number.
+
 ```cpp
 index<_Rank>& operator*=(
    int _Rhs
@@ -202,6 +205,7 @@ The element that's at the specified index.
 ### Remarks
 
 This following example displays the component values of the index.
+
 ```cpp
 // Prints 1 2 3.
 concurrency::index<3> idx(1, 2, 3);
@@ -213,6 +217,7 @@ std::cout << idx[2] << "\n";
 ## <a name="operator_add_add"></a>  operator++
 
 Increments each element of the index object.
+
 ```cpp
 index<_Rank>& operator++() restrict(amp,cpu);
 
@@ -228,6 +233,7 @@ For the prefix operator, the index object (*this). For the suffix operator, a ne
 ## <a name="operator_add_eq"></a>  operator+=
 
 Adds the specified number to each element of the index object.
+
 ```cpp
 index<_Rank>& operator+=(
    const index<_Rank>& _Rhs
@@ -250,6 +256,7 @@ The index object.
 ## <a name="operator_eq"></a>  operator=
 
 Copies the contents of the specified index object into this one.
+
 ```cpp
 index<_Rank>& operator=(
    const index<_Rank>& _Other
@@ -268,6 +275,7 @@ A reference to this index object.
 ## <a name="operator_-_eq"></a>  operator-=
 
 Subtracts the specified number from each element of the index object.
+
 ```cpp
 index<_Rank>& operator-=(
    const index<_Rank>& _Rhs
@@ -288,7 +296,9 @@ The number to subtract.
 The index object.
 
 ## <a name="rank"></a>  Rank
-  Gets the rank of the index object.
+
+Gets the rank of the index object.
+
 ```cpp
 static const int rank = _Rank;
 ```

docs/parallel/amp/reference/int-3-class.md

@@ -144,7 +144,7 @@ class int_3;
 
 Default constructor, initializes all elements with 0.
 
-## Syntax
+### Syntax
 
 ```cpp
 int_3() restrict(amp,cpu);
@@ -195,7 +195,7 @@ The object used to initialize.
 
 ## <a name="size"></a> size
 
-## Syntax
+### Syntax
 
 ```cpp
 static const int size = 3;

docs/parallel/amp/reference/short-vector-traits-structure.md

@@ -6,7 +6,7 @@ ms.assetid: cd9492da-9e02-4a6e-9d50-b61252cdb460
 ---
 # short_vector_traits Structure
 
-short_vector_traits allows retrival of the underlying vector length and scalar type of a short vector type or a scalar type
+short_vector_traits allows retrieval of the underlying vector length and scalar type of a short vector type or a scalar type
 
 ## Syntax
 

docs/parallel/amp/reference/texture-class.md

@@ -545,7 +545,7 @@ The next-to-most-significant component of the texture.
 The least significant component of the extent of the texture.
 
 *_Input_iterator*<br/>
-The type of the input interator.
+The type of the input iterator.
 
 *_Mipmap_levels*<br/>
 The number of mipmap levels in the underlying texture. If 0 is specified, the texture will have the full range of mipmap levels down to the smallest possible size for the specified extent.

docs/parallel/amp/using-tiles.md

@@ -9,7 +9,7 @@ You can use tiling to maximize the acceleration of your app. Tiling divides thre
 
 - `tile_static` variables. The primary benefit of tiling is the performance gain from `tile_static` access. Access to data in `tile_static` memory can be significantly faster than access to data in the global space (`array` or `array_view` objects). An instance of a `tile_static` variable is created for each tile, and all threads in the tile have access to the variable. In a typical tiled algorithm, data is copied into `tile_static` memory once from global memory and then accessed many times from the `tile_static` memory.
 
-- [tile_barrier::wait Method](reference/tile-barrier-class.md#wait). A call to `tile_barrier::wait` suspends execution of the current thread until all of the threads in the same tile reach the call to `tile_barrier::wait`. You cannot guarantee the order that the threads will run in, only that no threads in the tile will execute past the call to `tile_barrier::wait` until all of the threads have reached the call. This means that by using the `tile_barrier::wait` method, you can perform tasks on a tile-by-tile basis rather than a thread-by-thread basis. A typical tiling algorithm has code to initialize the `tile_static` memory for the whole tile followed by a call to `tile_barrer::wait`. Code that follows `tile_barrier::wait` contains computations that require access to all the `tile_static` values.
+- [tile_barrier::wait Method](reference/tile-barrier-class.md#wait). A call to `tile_barrier::wait` suspends execution of the current thread until all of the threads in the same tile reach the call to `tile_barrier::wait`. You cannot guarantee the order that the threads will run in, only that no threads in the tile will execute past the call to `tile_barrier::wait` until all of the threads have reached the call. This means that by using the `tile_barrier::wait` method, you can perform tasks on a tile-by-tile basis rather than a thread-by-thread basis. A typical tiling algorithm has code to initialize the `tile_static` memory for the whole tile followed by a call to `tile_barrier::wait`. Code that follows `tile_barrier::wait` contains computations that require access to all the `tile_static` values.
 
 - Local and global indexing. You have access to the index of the thread relative to the entire `array_view` or `array` object and the index relative to the tile. Using the local index can make your code easier to read and debug. Typically, you use local indexing to access `tile_static` variables, and global indexing to access `array` and `array_view` variables.
 
@@ -228,7 +228,7 @@ void SamplingExample() {
         }
         std::cout << "\n";
     }
-    // Output for SAMPLESSIZE = 2 is:
+    // Output for SAMPLESIZE = 2 is:
     //  4.5  6.5  8.5 10.5
     // 20.5 22.5 24.5 26.5
     // 36.5 38.5 40.5 42.5