title: Ada - Is there a way to traverse through each character of an unbounded string?
body: <p>I basically have a unbounded string called a for example. And a is currently storing "Hello". I want to check if the letter O is in the string. This is why I want to know if there is a way where I can check each character for a match and if there is a match. </p>
  
  <p>Note: I don't want to know if the entire string is equal, I just want to know if a particular character is in the string.</p>