Im having problems with a seg fault i cannot locate. The add, remove and best hashing functions need attn

#include

#include

#include

#include

#include "GlassesDisplay.hpp$"$

using std::string;

using std::ifstream;

using std::cout;

using std::endl;

unsigned int hashfct$1($unsigned int barcode$)\{$

return $($barcode $/1000000)\%10$;

$\}$

unsigned int hashfct$2($unsigned int barcode$)\{$

return $($barcode $/100000)\%10$;

$\}$

unsigned int hashfct$3($unsigned int barcode$)\{$

return $($barcode $/10000)\%10$;

$\}$

unsigned int hashfct$4($unsigned int barcode$)\{$

return $($barcode $/1000)\%10$;

$\}$

unsigned int hashfct$5($unsigned int barcode$)\{$

return $($barcode $/100)\%10$;

$\}$

unsigned int hashfct$6($unsigned int barcode$)\{$

return $($barcode $/10)\%10$;

$\}$

unsigned int hashfct$7($unsigned int barcode$)\{$

return barcode $\%10$;

$\}$

Glasses::Glasses$($string glassesColor, string glassesShape, string glassesBrand, unsigned int barcode$)$: glassesColor$\_($glassesColor$),$ glassesShape$\_($glassesShape$),$ glassesBrand$\_($glassesBrand$),$ barcode$\_($barcode$)$

$\{\}$;

void GlassesDisplay::readTextfile$($string filename$)\{$

ifstream myfile$($filename$)$;

if $($myfile$.$is$\_$open$())\{$

cout $<<$ "Successfully opened file $"<<$ filename $<<$ endl;

string glassesColor;

string glassesShape;

string glassesBrand;

unsigned int barcode;

while $($myfile $>>$ glassesColor $>>$ glassesShape $>>$ glassesBrand $>>$ barcode$)\{$

if $($glassesColor$.$size$()>0)$

addGlasses$($glassesColor$,$ glassesShape, glassesBrand, barcode$)$;

$\}$

myfile.close$()$;

$\}$

else

throw std::invalid$\_$argument$("$Could not open file $"+$ filename$)$;

$\}$

void GlassesDisplay::addGlasses$($string glassesColor, string glassesShape, string glassesBrand, unsigned int barcode$)\{$

Glasses new$\_$glasses$($glassesColor$,$ glassesShape, glassesBrand, barcode$)$;

hT$1[$hashfct$1($barcode$)]=$ new$\_$glasses;

hT$2[$hashfct$2($barcode$)]=$ new$\_$glasses;

hT$3[$hashfct$3($barcode$)]=$ new$\_$glasses;

hT$4[$hashfct$4($barcode$)]=$ new$\_$glasses;

hT$5[$hashfct$5($barcode$)]=$ new$\_$glasses;

hT$6[$hashfct$6($barcode$)]=$ new$\_$glasses;

hT$7[$hashfct$7($barcode$)]=$ new$\_$glasses;

$\}$

bool GlassesDisplay::removeGlasses$($unsigned int barcode$)\{$

if $($hT$1.$find$($barcode$)!=$ hT$1.$end$())\{$

hT$1.$erase$($barcode$)$;

hT$2.$erase$($barcode$)$;

hT$3.$erase$($barcode$)$;

hT$4.$erase$($barcode$)$;

hT$5.$erase$($barcode$)$;

hT$6.$erase$($barcode$)$;

hT$7.$erase$($barcode$)$;

return true;

$\}$

return false;

$\}$

size$\_$t GlassesDisplay::size$()\{$

if $(($hT$1.$size$()!=$ hT$2.$size$())||($hT$1.$size$()!=$ hT$3.$size$())||($hT$1.$size$()!=$ hT$4.$size$())||($hT$1.$size$()!=$ hT$5.$size$())||($hT$1.$size$()!=$ hT$6.$size$())||($hT$1.$size$()!=$ hT$7.$size$()))$

throw std::length$\_$error$("$Hash table sizes are not the same"$)$;

return hT$1.$size$()$;

$\}$

unsigned int GlassesDisplay::bestHashing$()\{$

$//$ Array of pointers to each of the hash tables

CustomHashTable$*$ hashTables$[7]=\{$&hT$1,$ &hT$2,$ &hT$3,$ &hT$4,$ &hT$5,$ &hT$6,$ &hT$7\}$;

unsigned int bestHashTableIndex $=0$;

size$\_$t minBalance $=$ static$\_$cast$(-1)$; $//$ Equivalent to std::numeric$\_$limits::max$()$

$//$ Iterate through each hash table

for $($unsigned int i $=0$; i $<7$; i$++)\{$

size$\_$t maxBucketSize $=0$;

size$\_$t minBucketSize $=$ static$\_$cast$(-1)$; $//$ Initialize to the maximum possible value

$//$ Check only the first $10$ buckets, or fewer if the hash table is smaller

unsigned int numBucketsToCheck $=$ static$\_$cast$($std::min$($static$\_$cast$(10),$ hashTables$[$i$]->$bucket$\_$count$()))$;

for $($unsigned int j $=0$; j $<$ numBucketsToCheck; j$++)\{$

size$\_$t bucketSize $=$ hashTables$[$i$]->$bucket$\_$size$($j$)$;

if $($bucketSize $>$ maxBucketSize$)\{$

maxBucketSize $=$ bucketSize; $//$ Update max bucket size found

$\}$

if $($bucketSize $<$ minBucketSize$)\{$

minBucketSize $=$ bucketSize; $//$ Update min bucket size found

$\}$

$\}$

size$\_$t currentBalance $=$ maxBucketSize $-$ minBucketSize; $//$ Compute the balance for the current hash table

if $($currentBalance $<$ minBalance$)\{$

minBalance $=$ currentBalance;

bestHashTableIndex $=$ i $+1$; $//$ Store the index of the best hash table $(1-$based index$)$

$\}$

$\}$

return bestHashTableIndex;

$\}$

#pragma once

#include

#include

using std::string;

struct Glasses $\{$

string glassesColor$\_$;

string glassesShape$\_$;

string glassesBrand$\_$;

unsigned int barcode$\_$;

Glasses$($string glassesColor $="",$ string glassesShape $="",$ string glassesBrand $="",$ unsigned int barcode $=1000000)$;

$\}$;

unsigned int hashfct$1($unsigned int$)$;

unsigned int hashfct$2($unsigned int$)$;

unsigned int hashfct$3($unsigned int$)$;

unsigned int hashfct$4($unsigned int$)$;

unsigned int hashfct$5($unsigned int$)$;

unsigned int hashfct$6($unsigned int$)$;

unsigned int hashfct$7($unsigned int$)$;

typedef std::unordered$\_$map CustomHashTable;

class GlassesDisplay $\{$

public:

$//$hpp file does not fit but is complete