Skip to main content

How to insert spans around every word where existing spans exist within each word

Given an HTML element tangled with miscellaneous internal spans, I want a function that dynamically inserts/wraps spans around every individual word within a parent element, even though existing spans 'disturb' a search using innerHTML; only a search of innerText will reveal the matches.

   // eg:    
<span id="parent">
  <span id="oldSpan1">Hardware:</span> <br> 
  the 
  <span id="child1">kicka</span>ble, 
  <span id="child2">throwa</span>ble, 
  <span id="child3">puncha</span>ble 
  components 
  of 
  a 
  <span  id="oldSpan2">computer</span>!
</span>

   // I want the result to be:
<span id="parent">
  <span id="word1"><span id="oldSpan1">Hardware:</span></span> <br> 
  <span id="word2">the</span> 
  <span id="word3"><span id="child1">kicka</span>ble</span>, 
  <span id="word4"><span id="child2">throwa</span>ble</span>, 
  <span id="word5"><span id="child3">puncha</span>ble</span> 
  <span id="word6">components</span> 
  <span id="word7">of</span> 
  <span id="word8">a</span> 
  <span id="word9"><span id="oldSpan2">computer</span></span>!
</span>    

(Please note that my actual task involves a string of non-Latin characters, so using a better regex to identify word boundaries will not help. For the purposes of this post I define a 'word' as whatever passes parent.innertext.match( wordBoundary_rx ) where wordBoundary = /\b/g. In my real task it is using the regex /[a-zA-ZɑoĢ‚ƔīĆŗȑƬĆŖɑĶ”iɑĶ”uÅ‹Ä”įø§nĢĘžÄ”čįø£Ć±tĢdĢÅ•rĢÅ„ȶvĢˆmĢˆįµÆĒ°ÉĆ¦Ć¦ĢyĢˆįŗ‡įŗsĢƒÅ›kĢ‡Å›Ģ¶gĢƒĢ¶]+/gm )

The only algorithm I could think of is very complicated involving manipulating the HTML String based on parsing the innerText with a regex (unrecommended by the Pundits) and I suspect there is a much more professional way using text nodes.

function createWordSpans ( parent ){
  const wordBoundary_rx = /\b/g
  const tagSplitter_rx. = /(<.*?>|[^<]+)\s*/g
  const textString = parent.innerText
  const textArray  = textString.match( wordBoundary_rx )
  let hTMLString   = parent.innerHTML
  const hTMLArray  = hTMLString.match( tagSplitter_rx )
  for ( const word of textArray ){
    
  }
}
#child1 {
  color: green;
}

#child2 {
  color: orange;
}

#child3 {
  color: red;
}
    <span id="parent">
      <span id="oldSpan1">Hardware:</span> <br> 
      the 
      <span id="child1">kicka</span>ble, 
      <span id="child2">throwa</span>ble, 
      <span id="child3">puncha</span>ble 
      components 
      of 
      a 
      <span  id="oldSpan2">computer</span>!
    </span>
Via Active questions tagged javascript - Stack Overflow https://ift.tt/qdnex3V

Comments

Popular posts from this blog

How to split a rinex file if I need 24 hours data

Trying to divide rinex file using the command gfzrnx but getting this error. While doing that getting this error msg 'gfzrnx' is not recognized as an internal or external command Trying to split rinex file using the command gfzrnx. also install'gfzrnx'. my doubt is I need to run this program in 'gfzrnx' or in 'cmdprompt'. I am expecting a rinex file with 24 hrs or 1 day data.I Have 48 hrs data in RINEX format. Please help me to solve this issue. source https://stackoverflow.com/questions/75385367/how-to-split-a-rinex-file-if-i-need-24-hours-data

ValueError: X has 10 features, but LinearRegression is expecting 1 features as input

So, I am trying to predict the model but its throwing error like it has 10 features but it expacts only 1. So I am confused can anyone help me with it? more importantly its not working for me when my friend runs it. It works perfectly fine dose anyone know the reason about it? cv = KFold(n_splits = 10) all_loss = [] for i in range(9): # 1st for loop over polynomial orders poly_order = i X_train = make_polynomial(x, poly_order) loss_at_order = [] # initiate a set to collect loss for CV for train_index, test_index in cv.split(X_train): print('TRAIN:', train_index, 'TEST:', test_index) X_train_cv, X_test_cv = X_train[train_index], X_test[test_index] t_train_cv, t_test_cv = t[train_index], t[test_index] reg.fit(X_train_cv, t_train_cv) loss_at_order.append(np.mean((t_test_cv - reg.predict(X_test_cv))**2)) # collect loss at fold all_loss.append(np.mean(loss_at_order)) # collect loss at order plt.plot(np.log(al...

Sorting large arrays of big numeric stings

I was solving bigSorting() problem from hackerrank: Consider an array of numeric strings where each string is a positive number with anywhere from to digits. Sort the array's elements in non-decreasing, or ascending order of their integer values and return the sorted array. I know it works as follows: def bigSorting(unsorted): return sorted(unsorted, key=int) But I didnt guess this approach earlier. Initially I tried below: def bigSorting(unsorted): int_unsorted = [int(i) for i in unsorted] int_sorted = sorted(int_unsorted) return [str(i) for i in int_sorted] However, for some of the test cases, it was showing time limit exceeded. Why is it so? PS: I dont know exactly what those test cases were as hacker rank does not reveal all test cases. source https://stackoverflow.com/questions/73007397/sorting-large-arrays-of-big-numeric-stings