<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Troubleshooting on Ken Huang</title>
    <link>https://blog.kenhuang.io/tags/troubleshooting/</link>
    <description>Recent content in Troubleshooting on Ken Huang</description>
    <generator>Hugo</generator>
    <language>en</language>
    <managingEditor>kenhuang512@gmail.com (Ken Huang)</managingEditor>
    <webMaster>kenhuang512@gmail.com (Ken Huang)</webMaster>
    <lastBuildDate>Sun, 19 Apr 2026 12:43:48 +0800</lastBuildDate>
    <atom:link href="https://blog.kenhuang.io/tags/troubleshooting/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A Trick to Troubleshoot Emacs Subprocess Creating</title>
      <link>https://blog.kenhuang.io/blog/2020-05-30-a-trick-to-troubleshoot-emacs-subprocess-creating/</link>
      <pubDate>Sat, 30 May 2020 11:52:00 +0800</pubDate><author>kenhuang512@gmail.com (Ken Huang)</author>
      <guid>https://blog.kenhuang.io/blog/2020-05-30-a-trick-to-troubleshoot-emacs-subprocess-creating/</guid>
      <description>&lt;p&gt;&#xA;There are many packages of Emacs that leverage subprocesses to do their jobs, &lt;a href=&#34;https://magit.vc/&#34;&gt;Magit&lt;/a&gt;, &lt;a href=&#34;https://github.com/joaotavora/eglot&#34;&gt;eglot&lt;/a&gt;, &lt;a href=&#34;https://github.com/jorgenschaefer/elpy&#34;&gt;elpy&lt;/a&gt;, to name a few. And there are times that a subprocess doesn&amp;#39;t work as expected, for example, Magit is slow, and you&amp;#39;re sure that it&amp;#39;s ok when running git commands on shell. So how to spot these problems effectively and quickly?&lt;/p&gt;&#xA;&lt;p&gt;&#xA;The problem is that we don&amp;#39;t know what&amp;#39;s going on exactly, so here I want to share a few Elisp advices to make the subprocess creating visible, and print the exact program and its arguments to the &lt;code class=&#34;verbatim&#34;&gt;*Message*&lt;/code&gt; buffer. Visibility is the key.&lt;/p&gt;</description>
    </item>
    <item>
      <title>The Binary Search Idea for Narrowing Down Problem Space</title>
      <link>https://blog.kenhuang.io/blog/2020-02-04-binary-search-algorithm-vs-problem-solving/</link>
      <pubDate>Tue, 04 Feb 2020 18:48:00 +0800</pubDate><author>kenhuang512@gmail.com (Ken Huang)</author>
      <guid>https://blog.kenhuang.io/blog/2020-02-04-binary-search-algorithm-vs-problem-solving/</guid>
      <description>&lt;p&gt;&#xA;&lt;a href=&#34;https://en.wikipedia.org/wiki/Binary_search_algorithm&#34;&gt;Binary search algorithm&lt;/a&gt; is a search algorithm that finds the position of a target value within a sorted array. It cuts off the target array in half in a pass, so that it has a worst-case performance of &lt;code class=&#34;verbatim&#34;&gt;O(log n)&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;figure&gt;&#xA;&lt;img src=&#34;https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg&#34; alt=&#34;https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg&#34; title=&#34;https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg&#34; /&gt;&lt;figcaption&gt;&#xA;Visualization of the binary search algorithm where 7 is the target value(@wikipedia)&#xA;&lt;/figcaption&gt;&#xA;&lt;/figure&gt;&#xA;&lt;p&gt;&#xA;We all know that it&amp;#39;s an efficient searching algorithm, but the strategy behind it also applies for narrowing down other problem space, for example, finding out when a bug is first introduced in a series of git commits.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
