class_docstr: Much like the standard GUIDerator, the SequentialGUIDerator is an
  iterator that yields a globally-unique identifier (GUID) on every
  iteration. The GUIDs produced are hexadecimal strings.
  The SequentialGUIDerator differs in that it picks a starting GUID
  value and increments every iteration. This yields GUIDs which are
  of course unique, but also ordered and lexicographically sortable.
  The SequentialGUIDerator is aronud 50% faster than the normal
  GUIDerator, making it almost 20x as fast as the built-in uuid
  module. By default it is also more compact, partly due to its
  96-bit (24-hexdigit) default length. 96 bits of randomness means that
  there is a 1 in 2 ^ 32 chance of collision after 2 ^ 64
  iterations. If more or less uniqueness is desired, the *size*
  argument can be adjusted accordingly.
  Args:
      size (int): character length of the GUID, defaults to 24.
  Note that with SequentialGUIDerator there is a chance of GUIDs
  growing larger than the size configured. The SequentialGUIDerator
  has built-in fork protection that causes it to detect a fork on
  next iteration and reseed accordingly.
code: def __next__(self):
      if os.getpid() != self.pid:
          self.reseed()
      return "%x" % (next(self.count) + self.start)
  
imports: import os
  import math
  import time
  import codecs
  import random
  import socket
  import hashlib
  import itertools
  from collections import Mapping, Sequence, Set, ItemsView
label_desc: Use image node_id 1 for calling the SequentialGUIDerator obj's underlying member method code with example usage: obj.__next__() and returns: unknown