diff options
author | Bjorn Helgaas <bhelgaas@google.com> | 2023-08-14 16:28:22 -0500 |
---|---|---|
committer | Jonathan Corbet <corbet@lwn.net> | 2023-08-18 11:29:03 -0600 |
commit | d56b699d76d1b352f7a3d3a0a3e91c79b8612d94 (patch) | |
tree | 2a368f3e2e17f7a516bf39e055f79d8c79a74885 /Documentation/input | |
parent | ebab9426cd73c45945b44344ca904b343f0ca070 (diff) | |
download | linux-stable-d56b699d76d1b352f7a3d3a0a3e91c79b8612d94.tar.gz linux-stable-d56b699d76d1b352f7a3d3a0a3e91c79b8612d94.tar.bz2 linux-stable-d56b699d76d1b352f7a3d3a0a3e91c79b8612d94.zip |
Documentation: Fix typos
Fix typos in Documentation.
Signed-off-by: Bjorn Helgaas <bhelgaas@google.com>
Link: https://lore.kernel.org/r/20230814212822.193684-4-helgaas@kernel.org
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
Diffstat (limited to 'Documentation/input')
-rw-r--r-- | Documentation/input/devices/iforce-protocol.rst | 2 | ||||
-rw-r--r-- | Documentation/input/multi-touch-protocol.rst | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/Documentation/input/devices/iforce-protocol.rst b/Documentation/input/devices/iforce-protocol.rst index 8634beac3fdb..52c1e0dd0ab7 100644 --- a/Documentation/input/devices/iforce-protocol.rst +++ b/Documentation/input/devices/iforce-protocol.rst @@ -49,7 +49,7 @@ OP DATA == ==== The 2B, LEN and CS fields have disappeared, probably because USB handles -frames and data corruption is handled or unsignificant. +frames and data corruption is handled or insignificant. First, I describe effects that are sent by the device to the computer diff --git a/Documentation/input/multi-touch-protocol.rst b/Documentation/input/multi-touch-protocol.rst index 1085cbee4ee7..47d3dcb5d44b 100644 --- a/Documentation/input/multi-touch-protocol.rst +++ b/Documentation/input/multi-touch-protocol.rst @@ -383,7 +383,7 @@ Finger Tracking --------------- The process of finger tracking, i.e., to assign a unique trackingID to each -initiated contact on the surface, is a Euclidian Bipartite Matching +initiated contact on the surface, is a Euclidean Bipartite Matching problem. At each event synchronization, the set of actual contacts is matched to the set of contacts from the previous synchronization. A full implementation can be found in [#f3]_. |