Archive Browser

using System.Runtime.InteropServices;

/* Dithering an image using the Floyd–Steinberg algorithm in C#
 * http://www.cyotek.com/blog/dithering-an-image-using-the-floyd-steinberg-algorithm-in-csharp
 *
 * Copyright © 2015 Cyotek Ltd.
 *
 * Licensed under the MIT License. See LICENSE.txt for the full text.
 */

namespace Cyotek.DitheringTest
{
  /// <summary>
  /// Represents an ARGB (alpha, red, green, blue) color.
  /// </summary>
  /// <remarks>The color of each pixel is represented as a 32-bit number: 8 bits each for alpha, red, green, and blue (ARGB). Each of the four components is a number from 0 through 255, with 0 representing no intensity and 255 representing full intensity. The alpha component specifies the transparency of the color: 0 is fully transparent, and 255 is fully opaque. To determine the alpha, red, green, or blue component of a color, use the A, R, G, or B property, respectively.</remarks>
  [StructLayout(LayoutKind.Explicit)]
  public struct ArgbColor
  {
    /// <summary>
    /// Gets the blue component value of this <see cref="ArgbColor"/> structure.
    /// </summary>
    [FieldOffset(0)]
    public byte B;

    /// <summary>
    /// Gets the green component value of this <see cref="ArgbColor"/> structure.
    /// </summary>
    [FieldOffset(1)]
    public byte G;

    /// <summary>
    /// Gets the red component value of this <see cref="ArgbColor"/> structure.
    /// </summary>
    [FieldOffset(2)]
    public byte R;

    /// <summary>
    /// Gets the alpha component value of this <see cref="ArgbColor"/> structure.
    /// </summary>
    [FieldOffset(3)]
    public byte A;

    public ArgbColor(int alpha, int red, int green, int blue)
      : this()
    {
      A = (byte)alpha;
      R = (byte)red;
      G = (byte)green;
      B = (byte)blue;
    }
  }
}