diff mbox series

docs: kbuild: fix typo

Message ID d78714e8005b52d5c5dee59bd47a0ba7011b0e55.1657772746.git.baruch@tkos.co.il (mailing list archive)
State New, archived
Headers show
Series docs: kbuild: fix typo | expand

Commit Message

Baruch Siach July 14, 2022, 4:25 a.m. UTC
on -> one.

Signed-off-by: Baruch Siach <baruch@tkos.co.il>
---
 Documentation/kbuild/kconfig-language.rst | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

Comments

Masahiro Yamada July 16, 2022, 8:13 a.m. UTC | #1
On Thu, Jul 14, 2022 at 1:26 PM Baruch Siach <baruch@tkos.co.il> wrote:
>
> on -> one.
>
> Signed-off-by: Baruch Siach <baruch@tkos.co.il>
> ---


Applied to linux-kbuild.
Thanks.


>  Documentation/kbuild/kconfig-language.rst | 2 +-
>  1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/Documentation/kbuild/kconfig-language.rst b/Documentation/kbuild/kconfig-language.rst
> index a7173843a294..7fb398649f51 100644
> --- a/Documentation/kbuild/kconfig-language.rst
> +++ b/Documentation/kbuild/kconfig-language.rst
> @@ -672,7 +672,7 @@ Future kconfig work
>  Work on kconfig is welcomed on both areas of clarifying semantics and on
>  evaluating the use of a full SAT solver for it. A full SAT solver can be
>  desirable to enable more complex dependency mappings and / or queries,
> -for instance on possible use case for a SAT solver could be that of handling
> +for instance one possible use case for a SAT solver could be that of handling
>  the current known recursive dependency issues. It is not known if this would
>  address such issues but such evaluation is desirable. If support for a full SAT
>  solver proves too complex or that it cannot address recursive dependency issues
> --
> 2.35.1
>
diff mbox series

Patch

diff --git a/Documentation/kbuild/kconfig-language.rst b/Documentation/kbuild/kconfig-language.rst
index a7173843a294..7fb398649f51 100644
--- a/Documentation/kbuild/kconfig-language.rst
+++ b/Documentation/kbuild/kconfig-language.rst
@@ -672,7 +672,7 @@  Future kconfig work
 Work on kconfig is welcomed on both areas of clarifying semantics and on
 evaluating the use of a full SAT solver for it. A full SAT solver can be
 desirable to enable more complex dependency mappings and / or queries,
-for instance on possible use case for a SAT solver could be that of handling
+for instance one possible use case for a SAT solver could be that of handling
 the current known recursive dependency issues. It is not known if this would
 address such issues but such evaluation is desirable. If support for a full SAT
 solver proves too complex or that it cannot address recursive dependency issues