Chained Jquery Ajax Calls

I am trying to retrieve some information about any given webpage (namely the of the page and the of the domain) and then make a jquery asynchronous POST with the retrieved information. Unfortunately, the javascript execution reaches the $.post(), but never makes the actual web request. Here is my code:

$.get('../embed', {u: url}, function(html) {
    alert('got "' + html + '"');
    $.post('/media/add', { story: storyid, caption: caption, type: 5, title: title, content: html, meta: meta }, function(data) {
        var obj = jQuery.parseJSON(data); 
        var thumb = imageUrlFromMedia(obj);
        var clip = addToClipboard(, thumb || '/img/icons/embedly.png',;

Is it even possible to make another ajax call in the success handler of $.get()? Has anyone here had any success with multiple chained HttpRequests before?


You can use $.ajax to find errors in the XML HTTP requests or JSON parsing (may not work for JSON parsing unfortunately). That should still display as text even if it fails to parse. Anyways, to get failure messages refactor as so

  url: '../embed',
  data: {u: url},
  success: function(html){
  error: function(XMLHTTPRequest, textStatus, errorThrown){
     //Danger Will Robinson

If you don't see a second request, this is the request that is failing. If you still don't find an error, try doing the same with the $.post. You should consider refactoring $.post to $.ajax. By the way, parseJSON is automatic if you use $.getJSON instead of $.post. This is akin to dataType: 'json' within $.ajax.

This can be done using native (no plugin) jQuery with the $.Deferred() classes.

This can be accessed most commonly using $.when().then() (see: or using more complex sequences using $.pipe() (see:

There's an example here using $.pipe():

For the simplest cases, I'd recommend using when-then. For more complex cases, you'll need to use pipe to build a larger chain of AJAX calls.

Need Your Help

AVL Tree Recurrence, how is 2*N_2 = O(2^(h/2))

algorithm avl-tree

I am trying to prove that the height of an AVL tree with N nodes, is at most log N. The proof:

“Optional” backreferences in regular expression

python regex

I have a regular expression with two groups that are OR'd and I'm wondering if it's possible to have a group be a back reference only if it matched? In all cases, I'm wanting to match

About UNIX Resources Network

Original, collect and organize Developers related documents, information and materials, contains jQuery, Html, CSS, MySQL, .NET, ASP.NET, SQL, objective-c, iPhone, Ruby on Rails, C, SQL Server, Ruby, Arrays, Regex, ASP.NET MVC, WPF, XML, Ajax, DataBase, and so on.