input: Write a function to calculate the Jaccard similarity between two given strings. The function should split each string into words, convert these words into sets of words, compute the intersection of these sets, and then return the size of the intersection divided by the size of the union of the sets. The function should take two strings as input and return a float representing the Jaccard similarity. If either string is empty, the function should return 0.
  
  assert get_jaccard_similarity("python programming", "java programming") == 0.5
  assert get_jaccard_similarity("hello world", "hello there") == 0.25
  assert get_jaccard_similarity("the quick brown fox", "the slow brown dog") == 0.33333
  assert get_jaccard_similarity("", "some text") == 0.0
  assert get_jaccard_similarity("alice bob", "") == 0.0
output: def get_jaccard_similarity(str1, str2):
      if not str1 or not str2:
          return 0.0
      set1 = set(str1.split())
      set2 = set(str2.split())
      intersection = set1.intersection(set2)
      union = set1.union(set2)
      return len(intersection) / len(union)