var http;

function getHTTPObject() { if (typeof XMLHttpRequest != 'undefined') { return new XMLHttpRequest(); } try { return new ActiveXObject("Msxml2.XMLHTTP"); } catch (e) { try { return new ActiveXObject("Microsoft.XMLHTTP"); } catch (e) {} } return false; }

function loadVideoFrame(video_id){
  if(FlashDetect.installed && FlashDetect.major >= 9 ){
    swapFocus(video_id);
    http = getHTTPObject();
    document.getElementById('videoFrame').innerHTML= "<div style='padding-top: 100px;height:350px'><img src='/simms/gallery_assets/dark_spinner.gif'></div>";
    http.open('get','../gallery/video_view.html?video_id='+video_id);

    http.onreadystatechange = function(){
      if(http.readyState == 4){
	var response = http.responseText;
	document.getElementById('videoFrame').innerHTML = response;
        runScripts(document.getElementById('videoFrame'));
      }else{
	document.getElementById('videoFrame').innerHTML = "<div style='padding-top: 100px;height:350px'><img src='/simms/gallery_assets/dark_spinner.gif'></div>";
      }
    }
    http.send(null);
  }else{
    document.getElementById('videoFrame').innerHTML = "<p>This content requires Adobe Flash Player 9. Please click on the image below to install it.</p><br><a href='http://www.adobe.com/go/getflashplayer'><img src='http://www.adobe.com/images/shared/download_buttons/get_flash_player.gif' border='0' alt='Get Adobe Flash player' /></a>";
  }
}


function swapFocus( video_id ){
  var container = document.getElementById('videoList');
  var elements  = container.getElementsByTagName("img");

  for (var i = 0; i < elements.length; i++) {
    var e = elements[i];
    e.style.border = ( e.getAttribute('id') == video_id ? '1px solid #A54413' : '1px solid #E6E6E8');
  }
}

function runScripts(e) {
  if (e.nodeType != 1) return; //if it's not an element node, return
 
  if (e.tagName.toLowerCase() == 'script') {
    eval(e.text); //run the script
  }
  else {
    var n = e.firstChild;
    while ( n ) {
      if ( n.nodeType == 1 ) runScripts( n ); //if it's an element node, recurse
      n = n.nextSibling;
    }
  }
}