<div dir="ltr">Hello everyone,<div><br></div><div>There was quite a bit of confusion over the requirement for Lab 8, so I figured I will try and explain it here:</div><div><br></div><div>-The current increment() function simply goes to the next item in a given bucket, or the next bucket if we are at the end of the current bucket. This, in no way, guarantees any order within the key space. You need to modify increment and decrement such that they traverse the hash map in key-order; i.e:</div><div><br></div><div>A hash map is given the key-value pairs: <1, "hi"> <4, "no"> <103, "why"></div><div><br></div><div>The actual container may look something like:</div><div><br></div><div>mElems[</div><div> 0 = {<1, "hi">}</div><div> ...</div><div> 2 = {<103, "why">}</div><div> ...</div><div> 4 = [<4, "no">}</div><div> ...</div><div>]</div><div><br></div><div>So the current iterator, used in a simple for-loop for printing, would display:</div><div><br></div><div>1, hi</div><div>103, why</div><div>4, no</div><div><br></div><div>Your implementation needs to display:</div><div><br></div><div>1, hi</div><div>4, no</div><div>103, why</div><div><br></div><div>You <b>cannot</b> change the actual bucket placement of any element for sorting purposes. Your in/decrement should be <i>const</i> safe: it should not modify the hash map.</div><div><div><br></div><div>Given the confusion, I will allot <b>one</b> day extra for this; the Lab is due <b>Friday 11:59 PM</b>, and will not be accepted for credit beyond that.</div><div><br></div><div><br></div><div><br></div><div>Good luck!</div>-- <br><div dir="ltr"><p style="margin:0in 0in 0.0001pt;font-size:12pt;font-family:'Times New Roman',serif"><span style="font-size:11pt;font-family:Calibri,sans-serif">Jordan Adamek</span></p></div>
</div></div>