<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Ming Choi on Medium]]></title>
        <description><![CDATA[Stories by Ming Choi on Medium]]></description>
        <link>https://medium.com/@mingchoi?source=rss-57c5295d711b------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*HUz0vjGZ8kJO1Whk.</url>
            <title>Stories by Ming Choi on Medium</title>
            <link>https://medium.com/@mingchoi?source=rss-57c5295d711b------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 10:23:00 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@mingchoi/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Detect Ctrl+C in golang]]></title>
            <link>https://medium.com/@mingchoi/detect-ctrl-c-in-golang-599a69b83d61?source=rss-57c5295d711b------2</link>
            <guid isPermaLink="false">https://medium.com/p/599a69b83d61</guid>
            <dc:creator><![CDATA[Ming Choi]]></dc:creator>
            <pubDate>Tue, 07 Apr 2020 06:10:19 GMT</pubDate>
            <atom:updated>2020-04-07T06:10:19.863Z</atom:updated>
            <content:encoded><![CDATA[<p>To detect the interrupt signal in console, golang already provided a method to subscribe it through channel:</p><pre>interrupt := make(chan os.Signal)</pre><pre>signal.Notify(interrupt, os.Interrupt, syscall.SIGTERM)</pre><pre>&lt;-interrup</pre><p>This code will subscribe the interrupt signal and block the execution and wait for it. It can be very useful to implement graceful shutdown for the program.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=599a69b83d61" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[[LeetCode] 728. Self Dividing Numbers (Golang)]]></title>
            <link>https://medium.com/@mingchoi/leetcode-728-self-dividing-numbers-golang-c9f19c922647?source=rss-57c5295d711b------2</link>
            <guid isPermaLink="false">https://medium.com/p/c9f19c922647</guid>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[leetcode]]></category>
            <dc:creator><![CDATA[Ming Choi]]></dc:creator>
            <pubDate>Thu, 06 Feb 2020 08:51:33 GMT</pubDate>
            <atom:updated>2020-02-06T08:51:33.224Z</atom:updated>
            <content:encoded><![CDATA[<h3>Question:</h3><blockquote>A <em>self-dividing number</em> is a number that is divisible by every digit it contains.</blockquote><blockquote>For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.</blockquote><blockquote>Also, a self-dividing number is not allowed to contain the digit zero.</blockquote><blockquote>Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.</blockquote><blockquote><strong>Example 1:</strong></blockquote><blockquote><strong>Input:</strong> <br>left = 1, right = 22<br><strong>Output:</strong> [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]</blockquote><h3>Easy Solution: Single-thread</h3><p>First, create a function that check a number is self divided or not.</p><pre>func isSelfDividing(i int) bool {<br>  r := i<br>  for ; r != 0; r /= 10 {<br>    d := r % 10<br>    if d == 0 || i%d != 0 {<br>      return false<br>    }<br>  }<br>  return true<br>}</pre><p>Then, check each numbers in range and collect them if it is self divided.</p><pre>func SelfDividingNumbers(left, right int) []int {<br>  result := make([]int, 0)<br>  for i := left; i &lt;= right; i++ {<br>    if isSelfDividing(i) {<br>      result = append(result, i)<br>    }<br>  }<br>  return result<br>}</pre><h3>Using Goroutins: Setup</h3><p>First idea come to mind is split the range to number of <em>GOMAXPROCS</em> to assign workload on CPU equally.</p><pre>n := runtime.GOMAXPROCS(0)<br>len := right - left + 1<br>for i := 0; i &lt; n; i++ {<br>  lo := i * len / n + 1<br>  hi := (i + 1) * len / n<br>  go func() {<br>    // check dividing number here...<br>  }()<br>}</pre><p>We need to send back the result from the goroutines, in that case we need <em>channel</em>.</p><p>Here’s come two option:</p><blockquote>1. Modify SelfDividingNumbers() to send each dividing number to channel</blockquote><blockquote>2. Use channel to collect group of dividing number from SelfDividingNumbers()</blockquote><h3>Using Goroutins: First option</h3><p>In the first option, channel is frequently used to send back the result, which is O(n) times. This cause serious performance issue to the algorithm. Here’s the benchmark:</p><pre>BenchmarkSelfDividingNumbers-6<br>573    2013209 ns/op    40190 B/op       13 allocs/op</pre><pre>BenchmarkSelfDividingNums_IntResult-6<br>786    1524524 ns/op    40453 B/op       15 allocs/op</pre><p>I’m running on a six core CPU, so it should be ~500% faster that single thread, instead of 37% faster only.</p><h3>Using Goroutins: Second option</h3><p>So we simply split the range into number of processor, and then assign them to goroutines for run the single-thread algorithm again. The results are sent to a channel once they are ready.</p><pre>for i := 0; i &lt; n; i++ {<br>  ...<br>  go func() {<br>    ch &lt;- SelfDividingNumbers(lo, hi)<br>  }()<br>}<br>...</pre><pre>for i := 0; i &lt; n; i++ {<br>  result = append(result, &lt;-ch...)<br>}</pre><p>Now we are sending []int for each goroutines, therefore it is called O(k) times where k = number of processor. There’s a dramatically change in the benchmark, which is now 530% faster:</p><pre>BenchmarkSelfDividingNumbers-6<br>573    2013209 ns/op    40190 B/op       13 allocs/op</pre><pre>BenchmarkSelfDividingNums_IntResult-6<br>786    1524524 ns/op    40453 B/op       15 allocs/op</pre><pre>BenchmarkSelfDividingNums_IntSliceResult-6<br>3037    469847 ns/op    77043 B/op       63 allocs/op</pre><h3>Final Code</h3><pre>func SelfDividingNums_IntSliceResult(left, right int) []int {<br>  n := runtime.GOMAXPROCS(0)<br>  ch := make(chan []int)</pre><pre>  len := right - left + 1<br>  for i := 0; i &lt; n; i++ {<br>    lo := i*len/n + 1<br>    hi := (i + 1) * len / n<br>    go func() {<br>      ch &lt;- SelfDividingNumbers(lo, hi)<br>    }()<br>  }</pre><pre>  result := make([]int, 0)<br>  for i := 0; i &lt; n; i++ {<br>    result = append(result, &lt;-ch...)<br>  }</pre><pre>  return result<br>}</pre><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c9f19c922647" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[[LeetCode] 134. Gas Station — Solution with explanation (0ms, 100% faster, 100% less)]]></title>
            <link>https://medium.com/@mingchoi/leetcode-134-gas-station-solution-with-explanation-0ms-100-faster-100-less-4d6db27d1496?source=rss-57c5295d711b------2</link>
            <guid isPermaLink="false">https://medium.com/p/4d6db27d1496</guid>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Ming Choi]]></dc:creator>
            <pubDate>Mon, 28 Oct 2019 09:44:52 GMT</pubDate>
            <atom:updated>2019-10-28T09:44:52.548Z</atom:updated>
            <content:encoded><![CDATA[<h3>[LeetCode] 134. Gas Station — Solution with explanation (0ms, 100% faster, 100% less memory)</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*6zBSkDnzgt1FlhHHVsES3Q.png" /></figure><h3>Question:</h3><blockquote>There are N gas stations along a circular route, where the amount of gas at station i is gas[i].</blockquote><blockquote>You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.</blockquote><blockquote>Return the starting gas station’s index if you can travel around the circuit once in the clockwise direction, otherwise return -1.</blockquote><h3>Easy Solution: Brute-force</h3><p>First, consider reducing both gain and lose array into one array.</p><pre>gas = [1, 2, 3, 4, 5]<br>cost = [3, 4 ,5, 1, 2]<br>gas[n] - cost[n] -&gt; [-2, -2, -2, 3, 3]</pre><p>In this representation, it can tell if this circuit can be travel around when sum &gt;= 0. If sum &lt; 0 then there will be no way to travel around since gas is lower than cost.</p><p>Then, start to loop over different starting point and drop that route if balance is lower then 0:</p><pre>start at i = 0: [-2, -2, -2, 3, 3]<br>                 ^ drop<br>start at i = 1: [-2, -2, 3, 3, -2]<br>                 ^ drop<br>start at i = 2: [-2, 3, 3, -2, -2]<br>                 ^ drop<br>start at i = 3: [3, 3, -2, -2, -2]<br>                                  ^ clean<br>start at i = 4: [3, -2, -2, -2, 3]<br>                         ^ drop</pre><p>That is the O(n²) way. To improve it, try not to iterate all the routes, but find out the best starting point in just one loop.</p><h3>Improve it with Queue</h3><p>To do that, consider using `Queue` to achieve that:</p><pre>[-2, -2, -2, 3, 3] &lt; -2<br> ^ drop -------- then push<br>[-2, -2, 3, 3, -2]<br>...repeat few times<br>[3, 3, -2, -2, -2]<br><br>The actually queue that loop though:<br>-2, -2, -2, [3, 3, -2, -2, -2]</pre><p>Since queue is just popping the first element and add it to the end, you don’t have to recalculate the sum for next starting point. You just need to subtract the sum by the element you just pop, then you have the sum of the current queue for next starting point. There’s an example:</p><pre>balance = [1, -2, 3]<br><br>[1], -2, 3 // sum = 1, len = 1<br>[1, -2], 3 // sum = -1, len = 2<br>[-2], 3, 1 // sum = -2, len = 1<br>[3], 1, -2 // sum = 3, len = 1<br>[3, 1], -2 // sum  = 4, len = 2<br>[3, 1, -2] // sum = 2, len = 3</pre><p>So this is a O(2n) solution. But I think there is still room for improvement.</p><h3>Improve it to O(n)</h3><p>This is very tricky since we know that there is always a solution when balance &gt;= 0, so why don’t we just not adding the popped element in the back and sum them instead?</p><pre>[1], -2, 3 // sum = 1, negative = 0, pointer = 0<br>[1, -2], 3 // sum = -1, negative = 0, pointer = 0<br>// Not enough gas<br>1, -2, [3] // sum = 3, negative = -1, pointer = 2<br>// Sum + negative &gt;= 0, enough gas for travel around the circuit</pre><p>▃▂▁█▇▆▅▄</p><p>The sum will look like the graph above, all we need to do is dropping the route that balance is negative and check if the remain route left enough gas to travel all of the dropped route.</p><h3>Final Code</h3><pre>public int canCompleteCircuit(int[] gas, int[] cost) {<br>        int n = 0;<br>        int s = 0;<br>        int p = 0;<br><br>        for (int i = 0; i &lt; gas.length; i++) {<br>            s += gas[i] - cost[i];<br>            if (s &lt; 0) {<br>                n += s;<br>                s = 0;<br>                p = i + 1;<br>            }<br>        }<br><br>        return s + n &gt;= 0 ? p : -1;<br>    }</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*6zBSkDnzgt1FlhHHVsES3Q.png" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=4d6db27d1496" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Error Handling with RxJava]]></title>
            <link>https://medium.com/@mingchoi/error-handling-with-rxjava-ef0f51cd3b37?source=rss-57c5295d711b------2</link>
            <guid isPermaLink="false">https://medium.com/p/ef0f51cd3b37</guid>
            <category><![CDATA[android]]></category>
            <category><![CDATA[error-handling]]></category>
            <category><![CDATA[rxjava]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Ming Choi]]></dc:creator>
            <pubDate>Tue, 11 Jun 2019 09:24:37 GMT</pubDate>
            <atom:updated>2019-06-11T09:24:37.115Z</atom:updated>
            <content:encoded><![CDATA[<p>Observable can raise error by calling onError() and catch with Subscriber. But this is not the only way to manage error in RxJava. There are lot of useful operator that could help you to handle error with different strategy:</p><blockquote>doOnError<br>onErrorResumeNext<br>onErrorResume<br>onErrorReturn<br>onErrorReturnItem<br>retry<br>retryUtil<br>retryWhen<br>…</blockquote><p>First, this is how to print stack trace from an exception:</p><blockquote>getMessages$.doOnError(e -&gt; e.printStackTrace())</blockquote><p>If your stream is a HTTP request, you might want to retry it:</p><blockquote>getMessages$.retry(3)</blockquote><p>Or emit an empty result as default value:</p><blockquote>getMessages$.onErrorReturnItem(new ArrayList&lt;Message&gt;())</blockquote><p>Maybe fallback to another stream:</p><blockquote>getMessages$.onErrorResumeNext(getOfflineMessages$)</blockquote><p>Let’s put it all together:</p><blockquote>getMessages$<br>.doOnError(e -&gt; Log.e(“MessageActivity”, “Get message failed. retrying.”))<br>.retry(3)<br>.doOnError(e -&gt; Log.e(“MessageActivity”, “Fallback to Get offline messages.”))<br>.onErrorResumeNext(getOfflineMessages$)<br>.doOnError(e -&gt; e.printStackTrace())<br>.onErrorReturnItem(emptyMessagesList())</blockquote><p>Quite easy, right?</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ef0f51cd3b37" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[簡化/重構 巢狀 if statements]]></title>
            <link>https://medium.com/@mingchoi/%E7%B0%A1%E5%8C%96-%E9%87%8D%E6%A7%8B-%E5%B7%A2%E7%8B%80-if-statements-552821bde211?source=rss-57c5295d711b------2</link>
            <guid isPermaLink="false">https://medium.com/p/552821bde211</guid>
            <category><![CDATA[design-patterns]]></category>
            <category><![CDATA[refactoring]]></category>
            <category><![CDATA[設計模式]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Ming Choi]]></dc:creator>
            <pubDate>Wed, 01 May 2019 02:00:50 GMT</pubDate>
            <atom:updated>2019-05-01T05:29:27.300Z</atom:updated>
            <content:encoded><![CDATA[<p>最近在練習文字處理，情境是：</p><blockquote>輸入一個String(可以以空格或附號隔空，也可能是Camel-Case)，將每個字詞拆開成Array</blockquote><p>例如:<br>“Hello Happy World” -&gt; “Hello”, “Happy”, “World”<br>“HELLO_HAPPY_WOLRD” -&gt; “Hello”, “Happy”, “World”<br>“helloHappyWorld” -&gt; “Hello”, “Happy”, “World”<br>“ 9h37Y2_” -&gt; “9”, “H37”, “Y2”</p><p>最暴力的做法，就立刻會想到用/[^A-Za-z0–9]/把字串split開吧？但是Camel-Case就照顧不到了，所以後面還要再loop through一次來處理Camel-Case的情況再concat，Performance大概不會太好。</p><p>那麼自幹一個輪子吧！（想當然是為了練習）</p><blockquote>先考慮一下所有情況：<br>aa -&gt; pass<br>Aa -&gt; pass<br>AA -&gt; pass<br>aA -&gt; split</blockquote><blockquote>a. -&gt; split<br>.a -&gt; split</blockquote><blockquote>r9 -&gt; pass<br>88 -&gt; pass<br>3e -&gt; split</blockquote><p>那麼從i=1開始loop through一次，比對目前和上一個字符類型就可以了吧。</p><p>先試寫個測試（看看就好）：</p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/101d5c4981ab4e31b81df6ee29c7e7b7/href">https://medium.com/media/101d5c4981ab4e31b81df6ee29c7e7b7/href</a></iframe><p>再寫程式碼：</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/506/1*8dYloZ-jHUT2AFybL4dgKQ.png" /><figcaption>link: <a href="https://gist.github.com/mingchoi/e6787b0619eb0870c21d5cb75ec04f2e">https://gist.github.com/mingchoi/e6787b0619eb0870c21d5cb75ec04f2e</a></figcaption></figure><p>測試全過！OK冇問題。</p><p>但是…</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/825/1*ucFcskAGCZo4GShGRuwFcQ.png" /></figure><p>這些nested if statement也<strong>太難讀了</strong>，先做點什麼看看吧？</p><p>來把if statement轉成switch：</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/794/1*1JGwtbwVyWXMf6cJwmQcrw.png" /><figcaption>link: <a href="https://gist.github.com/mingchoi/18267f34284aff3803c5aebd2919a2b2">https://gist.github.com/mingchoi/18267f34284aff3803c5aebd2919a2b2</a></figcaption></figure><p>沒了大括號好像好讀一點點了，但是本質上也跟原來的if statement無異。而且<strong>決策和執行的程式碼也混在一起，非常難維護</strong>。</p><p>先試試把程式碼切分為更多小function吧：</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/819/1*J3osZKf9H3eRk-sw0FcAwA.png" /><figcaption>link: <a href="https://gist.github.com/mingchoi/09f137949ae2fbc10a78e94b7d80dc7c">https://gist.github.com/mingchoi/09f137949ae2fbc10a78e94b7d80dc7c</a></figcaption></figure><p>把switch case裡面的procedure抽出之後，細節被隱藏起來，主程式部份可讀性有明顯提高，感覺方向對了。</p><p>但是難以維護的問題還是沒有解決，而且抽出來的function也是<strong>impure function</strong>，沒辦法測試，修改時也有可能會<strong>污染到外部變數</strong>。</p><p>目標是<strong>將決策和執行的程式碼分離</strong>，先把function改為<strong>pure function</strong>並回傳決策結果，主程式碼則對應<strong>回傳的決策結果</strong>執行相應動作。</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/731/1*bs9jN9tOzygYDtku88AEjA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/728/1*fRTxPyQ_a-xABvv4s4dlnQ.png" /><figcaption>link: <a href="https://gist.github.com/mingchoi/e1f2ae22c18472105eb6e7fc6304e57b">https://gist.github.com/mingchoi/e1f2ae22c18472105eb6e7fc6304e57b</a></figcaption></figure><p>這種方法抽出來的小function可以<strong>獨立進行測試</strong>，日後需要修改時亦不會錯誤使用到外部的變數，而且這些function也可以用return的技巧來令邏輯更加整潔。</p><p>不但增加了整體的<strong>可讀性</strong>，也同時建立了<strong>可測試又容易維護</strong>的架構。</p><p>最後，可以用Table Driven Method取代switch來進一步簡化。</p><p>先將先前抽出來的function整合到table上面，並以Tag分類：</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/761/1*2iBiR632DTzJsPImVIenJg.png" /></figure><p>那麼主程式就可以簡單地透過map取得function：</p><blockquote>fn := handlers[key]</blockquote><p>最後，主程式變成這樣子：</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/748/1*td_uJ9CRTq-HQUlDRKVrnQ.png" /><figcaption>link: <a href="https://gist.github.com/mingchoi/7cf9f3b47169afce6b76ea56ac723c89">https://gist.github.com/mingchoi/7cf9f3b47169afce6b76ea56ac723c89</a></figcaption></figure><p>而且，如果日後要加入emoji的處理，<strong>完全不需要改動主程式</strong>，只要：</p><ul><li>新增Emoji Type並加入檢查到checkRuneType</li><li>在table裡增加Emoji決策的function</li></ul><p>這樣就可以很容易增加到新需求，感覺似曾相識嗎？其實這就是設計模式裡的<a href="https://en.wikipedia.org/wiki/Strategy_pattern">策略模式</a>。</p><p>OK冇問題~</p><p>（如有可以改善的地方，請多多指教！）</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=552821bde211" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[iOS 實現一鍵安裝]]></title>
            <link>https://medium.com/@mingchoi/ios-%E5%AF%A6%E7%8F%BE%E4%B8%80%E9%8D%B5%E5%AE%89%E8%A3%9D-783c25a8dcdc?source=rss-57c5295d711b------2</link>
            <guid isPermaLink="false">https://medium.com/p/783c25a8dcdc</guid>
            <category><![CDATA[html]]></category>
            <category><![CDATA[javascript]]></category>
            <category><![CDATA[ios-app-development]]></category>
            <dc:creator><![CDATA[Ming Choi]]></dc:creator>
            <pubDate>Tue, 23 Apr 2019 08:16:40 GMT</pubDate>
            <atom:updated>2019-04-23T08:16:40.795Z</atom:updated>
            <content:encoded><![CDATA[<p>準備工作:</p><ol><li>Over the Air (OTA)所需的 ipa檔和plist檔</li><li>一台HTTPS Web Server</li></ol><p>3. 將ipa檔和plist檔 host 在Web Server上</p><p>OTA會透過 URL Scheme 來執行安裝動作，格式如下:</p><pre><a href="http://itms-services//?action=download-manifest&amp;url=https://www.impigertech.com/iSOL.plist">itms-services://?action=download-manifest&amp;url=https://your-web-server.com/my-app.plist</a></pre><p>點擊後會出現:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/428/1*OejAiHlDhiohgMiDVnboCQ.png" /></figure><p>若使用window.location直接進入網址會額外多顯示一次以”iTunes打開”的Dialog，解決方法是讓用戶在Safari點擊&lt;a&gt; Tag進入網址，就會直接出現Install Dialog。</p><pre>&lt;a id=”installButton” href=”<a href="http://itms-services//?action=download-manifest&amp;url=https://www.impigertech.com/iSOL.plist">itms-services://?action=download-manifest&amp;url=https://your-web-server.com/my-app.plist</a>”&gt;立即安裝&lt;/a&gt;</pre><p>如果想從額外的json檔讀取鏈結也可以加入:</p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/d45d86583a48d8eceb976450603d1ba5/href">https://medium.com/media/d45d86583a48d8eceb976450603d1ba5/href</a></iframe><p>OK冇問題~</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=783c25a8dcdc" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>