Add BlueRowColumnMask to hide columns w/ minimal overhead

Less overhead than ProjectStream
This commit is contained in:
John Colvin committed 2025-08-24 13:46:46 -04:00
1 parent 2af3c6e98d
commit db2bd425be
1 file changed
+62
@@ -0,0 +1,62 @@
#nullable enable
namespace Bts.DataStreamCore;
using BCG;
using bts.collections;
using System;
using System.Collections.Generic;
public class BlueRowColumnMask : IBlueRow {
readonly IBlueRow row;
readonly int[] hiddenColumns;
public BlueRowColumnMask(IBlueRow row, params int[] hiddenColumns) {
this.row = row;
this.hiddenColumns = hiddenColumns;
Array.Sort(hiddenColumns);
}
/// <summary>
/// Provides a way to explicitly skip sorting hiddenColumns. This is done at the callers risk,
/// as the index (int) operator performs a binary search on hiddenColumns.
/// </summary>
/// <param name="row">The underlying row whose columns to hide</param>
/// <param name="sortHiddenColumns">Whether or not to sort <paramref name="hiddenColumns"/> in
/// the constructor. They are sorted by default to ensure correct behavior in the index (int)
/// operator, which performs a binary search on this array.</param>
/// <param name="hiddenColumns">The columns (indices) to hide</param>
public BlueRowColumnMask(IBlueRow row, bool sortHiddenColumns, params int[] hiddenColumns) {
this.row = row;
this.hiddenColumns = hiddenColumns;
if (sortHiddenColumns) {
Array.Sort(hiddenColumns);
}
}
public object? this[string colName] {
get {
for (int i = 0; i < hiddenColumns.Length; i++) {
if (row.schema.columnInfo[i].colName == colName) {
throw new KeyNotFoundException();
}
}
return row[colName];
}
}
public object? this[int index] {
get {
if (index > row.schema.columnInfo.Length - hiddenColumns.Length) {
throw new IndexOutOfRangeException();
}
int pos = hiddenColumns.BinarySearch(index);
if (pos < 0) {
pos = ~pos;
}
return row[index + pos];
}
}
public IBlueTableSchema schema => row.schema;
}