Merge pull request #502 from practicalswift/fix-typos-6

Fix typos (6 of 30)
This commit is contained in:
Michael Gottesman
2015-12-13 19:03:41 -06:00
10 changed files with 11 additions and 11 deletions

View File

@@ -1195,7 +1195,7 @@
</pre>
<p>Array types include a base type and an optional size. Array types indicate
a linear sequence of elements stored consequtively memory. Array elements may
a linear sequence of elements stored consecutively memory. Array elements may
be efficiently indexed in constant time. All array indexes are bounds checked
and out of bound accesses are diagnosed with either a compile time or
runtime failure (TODO: runtime failure mode not specified).</p>

View File

@@ -24,7 +24,7 @@ namespace swift {
class SILFunction;
class SILBasicBlock;
/// Return true if we conservativly find all BB's that are non-failure exit
/// Return true if we conservatively find all BB's that are non-failure exit
/// basic blocks and place them in \p BBs. If we find something we don't
/// understand, bail.
///

View File

@@ -158,7 +158,7 @@ private:
bool isInWorkList = false;
/// True if the merge is finished (see mergeTo). In this state this node
/// is completly unlinked from the graph,
/// is completely unlinked from the graph,
bool isMerged = false;
/// The type of the node (mainly distinguishes between content and value

View File

@@ -2437,7 +2437,7 @@ namespace {
}
case EnumKind::Unknown: {
// The enumeration was mapped to a struct containining the integral
// The enumeration was mapped to a struct containing the integral
// type. Create a constant with that struct type.
auto dc = Impl.importDeclContextOf(clangEnum);

View File

@@ -2236,7 +2236,7 @@ void ArrayPropertiesSpecializer::specializeLoopNest() {
auto *Header = CheckBlock->getSingleSuccessor();
assert(Header);
// Our loop info is not really completedly valid anymore since the cloner does
// Our loop info is not really completely valid anymore since the cloner does
// not update it. However, exit blocks of the original loop are still valid.
SmallVector<SILBasicBlock *, 16> ExitBlocks;
Lp->getExitBlocks(ExitBlocks);

View File

@@ -2275,7 +2275,7 @@ public:
/// \returns true if an error occurred, false otherwise.
bool simplify(bool ContinueAfterFailures = false);
/// \brief Simplify the given constaint.
/// \brief Simplify the given constraint.
SolutionKind simplifyConstraint(const Constraint &constraint);
private:

View File

@@ -785,9 +785,9 @@ public:
/// \brief Determine whether a constraint of the given kind can be satisfied
/// by the two types.
///
/// \param t1 The first type of the constrant.
/// \param t1 The first type of the constraint.
///
/// \param t2 The second type of the constrant.
/// \param t2 The second type of the constraint.
///
/// \param dc The context of the conversion.
///

View File

@@ -201,7 +201,7 @@ public:
// Build the new cache entry.
// For some cache types this call may re-entrantly perform additional
// cache lookups.
// Notice that the entry is completly constructed before it is inserted
// Notice that the entry is completely constructed before it is inserted
// into the map, and that only one entry can be constructed at once
// because of the lock above.
Entry *entry = entryBuilder();

View File

@@ -7,7 +7,7 @@ func f1() { }
func f2() { }
// The old implementation of the LifetimeChecker in DefiniteInitialization had
// an exponential compuation complexity in some cases.
// an exponential computation complexity in some cases.
// This test should finish in almost no time. With the old implementation it
// took about 8 minutes.

View File

@@ -355,7 +355,7 @@ class C {
}
// Check that checked_cast_br jump-threading works properly when both
// condititions are arguments of the function's entry block.
// conditions are arguments of the function's entry block.
// CHECK: sil @test_checked_cast_br_jump_threading_with_entry_bb_arguments
// CHECK: checked_cast_br %0
// CHECK: checked_cast_br %1