input: Write a function to calculate the Jaccard similarity coefficient between two given strings. The Jaccard similarity is a measure of similarity between two sets of elements, which in this case will be the words in the input strings. The function should split the strings into sets of words and then compute the ratio of the size of the intersection of these sets to the size of their union. If both strings are empty, return 1.0.
  def get_jaccard_similarity(str1, str2):
      if str1 == "" and str2 == "":
          return 1.0
      a = set(str1.split()) 
      b = set(str2.split())
      c = a.intersection(b)
      return float(len(c)) / (len(a) + len(b) - len(c))
  
  assert get_jaccard_similarity("python programming", "java programming") == approx(0.5)
  assert get_jaccard_similarity("python", "java") == approx(0.0)
  assert get_jaccard_similarity("", "") == approx(1.0)
  assert get_jaccard_similarity("programming language", "language coding") == approx(0.333)
  assert get_jaccard_similarity("hello world", "hello world") == approx(1.0)
output: def get_jaccard_similarity(str1, str2):
      if str1 == "" and str2 == "":
          return 1.0
      a = set(str1.split()) 
      b = set(str2.split())
      c = a.intersection(b)
      return float(len(c)) / (len(a) + len(b) - len(c))