<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>CSharp on Dong&#39;s Notes</title>
    <link>https://levandong.dev/en/tags/csharp/</link>
    <description>Recent content in CSharp on Dong&#39;s Notes</description>
    <image>
      <title>Dong&#39;s Notes</title>
      <url>https://levandong.dev/</url>
      <link>https://levandong.dev/</link>
    </image>
    <generator>Hugo -- 0.162.1</generator>
    <language>en</language>
    <copyright>Privacy • Copyright</copyright>
    <lastBuildDate>Tue, 06 Aug 2024 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://levandong.dev/en/tags/csharp/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Save data less in database using theory of bit in C#</title>
      <link>https://levandong.dev/en/bit-field-c-sharp-like-cpp/</link>
      <pubDate>Tue, 06 Aug 2024 00:00:00 +0000</pubDate>
      <guid>https://levandong.dev/en/bit-field-c-sharp-like-cpp/</guid>
      <description>&lt;p&gt;Using bit fields in C/C++ might be familiar to you. In C/C++, bit fields allow you to create multiple variables within a single byte, within the limits of the bit representation. Today, I’m sharing a similar technique for C#. It&amp;rsquo;s important to note that this method doesn&amp;rsquo;t exactly mirror C/C++ bit fields. Instead of optimizing variable size at runtime, it focuses on optimizing data storage. This post will guide you through this technique and compare it with C/C++.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
