失われた番号を見つけるより効率的な方法

Question 1

いいえawk、各シェルに対して次のことを行います。

{ printf '[0] Slot%s\n' {00..23} ; grep -Eo '\[0\] Slot..' disks ; } | sort | uniq -u

遅い:

printf '[0] Slot%s\n' {00..23}可能なすべてのディスクのリストの作成
grep -Eo '\[0\] Slot..' disks既存ディスクの抽出
{..}は両方のコマンドの出力を接続します。
sort | uniq -u一度だけ現れる行の抽出

printfおよびgrepステップを適切な機能に置き換えるか、printf部分を他のファイル（予想ディスクのリストなど）の同様のgrepに置き換えることができます。

Answer

いいえawk、各シェルに対して次のことを行います。

{ printf '[0] Slot%s\n' {00..23} ; grep -Eo '\[0\] Slot..' disks ; } | sort | uniq -u

遅い:

printf '[0] Slot%s\n' {00..23}可能なすべてのディスクのリストの作成
grep -Eo '\[0\] Slot..' disks既存ディスクの抽出
{..}は両方のコマンドの出力を接続します。
sort | uniq -u一度だけ現れる行の抽出

printfおよびgrepステップを適切な機能に置き換えるか、printf部分を他のファイル（予想ディスクのリストなど）の同様のgrepに置き換えることができます。

Question 2

どの項目が必要かを事前に知っているので、リストを作成して見えるようにチェックマークを付けてください。

awk '
    BEGIN {
        for (i = 0; i < 24; i++) missing[0][sprintf("%02d", i)] = 1;
        for (i = 0; i < 12; i++) missing[1][sprintf("%02d", i)] = 1;
    }
    $7 ~ /^\[[0-9]+\]$/ && $8 ~ /^Slot[0-9]+$/ {
        gsub(/[^0-9]/, "", $7);
        sub(/^[^0-9]+/, "", $8);
        delete missing[$7][$8];
    }
    END {
        for (enclosure in missing) {
            for (slot in missing[enclosure]) {
                printf "Missing enclosure %d Slot%s\n", enclosure, slot;
            }
        }
    }
'

Answer

どの項目が必要かを事前に知っているので、リストを作成して見えるようにチェックマークを付けてください。

awk '
    BEGIN {
        for (i = 0; i < 24; i++) missing[0][sprintf("%02d", i)] = 1;
        for (i = 0; i < 12; i++) missing[1][sprintf("%02d", i)] = 1;
    }
    $7 ~ /^\[[0-9]+\]$/ && $8 ~ /^Slot[0-9]+$/ {
        gsub(/[^0-9]/, "", $7);
        sub(/^[^0-9]+/, "", $8);
        delete missing[$7][$8];
    }
    END {
        for (enclosure in missing) {
            for (slot in missing[enclosure]) {
                printf "Missing enclosure %d Slot%s\n", enclosure, slot;
            }
        }
    }
'

Question 3

perl -sle '
  my(@e, @AoA) = qw/ 24 12 /;
  $AoA[$1][$2]++ while /\[([01])]\h+(?:(?!\d)\S)+0*(\d+)$/mg;
  for my $enc ( 0 .. $#e ) {
     for my $m_slot ( grep { ! defined $AoA[$enc][$_] } 0 .. $e[$enc]-1 ) {
         print "in enclosure $enc - Slot$m_slot is missing.";
     }
  }
 ' -- -_="$DISK_INFO";

説明する：

°  Initialize the array @e which holds the number of slots in the various enclosures. 

° The Disk info variable is passed into the command line as $_ initialized to $DISK_INFO. 

°  progressively scan and match the $_ variable using the while loop and look for the numbers in the '[..]' and the 'Slot...'  locations. Using these we update the array of array @AoA, it can be viewed as a matrix. 

°  Now once we have ingested all the data, its time to process it now in two for loops. 

° The outer for loops on the enclosures, in our case, they are two. 

° The inner for loop computes the indices of the current enclosure elements that are undefined, IOW, those slots that were never encountered during the data collection drive in the while loop.

Answer

perl -sle '
  my(@e, @AoA) = qw/ 24 12 /;
  $AoA[$1][$2]++ while /\[([01])]\h+(?:(?!\d)\S)+0*(\d+)$/mg;
  for my $enc ( 0 .. $#e ) {
     for my $m_slot ( grep { ! defined $AoA[$enc][$_] } 0 .. $e[$enc]-1 ) {
         print "in enclosure $enc - Slot$m_slot is missing.";
     }
  }
 ' -- -_="$DISK_INFO";

説明する：

°  Initialize the array @e which holds the number of slots in the various enclosures. 

° The Disk info variable is passed into the command line as $_ initialized to $DISK_INFO. 

°  progressively scan and match the $_ variable using the while loop and look for the numbers in the '[..]' and the 'Slot...'  locations. Using these we update the array of array @AoA, it can be viewed as a matrix. 

°  Now once we have ingested all the data, its time to process it now in two for loops. 

° The outer for loops on the enclosures, in our case, they are two. 

° The inner for loop computes the indices of the current enclosure elements that are undefined, IOW, those slots that were never encountered during the data collection drive in the while loop.

失われた番号を見つけるより効率的な方法

答え1

答え2

答え3

関連情報