FINAL suepr merge step : added all modules to this super repos

This commit is contained in:
Bachir Soussi Chiadmi
2015-04-19 16:46:59 +02:00
7585 changed files with 1723356 additions and 18 deletions

View File

@@ -0,0 +1,339 @@
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License.

View File

@@ -0,0 +1,52 @@
Ajaxify Search API pages.
1. INSTALLATION AND CONFIGURATION
This Ajax module does not understand your theme CSS id's by default. You must
implement a custom module hook to let it know about your theme.
For example, create and enable a custom mymodule.module containing this code:
<?php
/**
* Implements hook_search_api_ajax_settings().
*/
function mymodule_search_api_ajax_settings() {
$settings = array(
// CSS id for main content (search results html)
// format: content => CSS id
'content' => '#content .content',
// CSS id's for regions containing search blocks
// check your region names in mytheme.info
// format: region_name => CSS id
'regions' => array(
'sidebar_first' => '#sidebar-first',
'sidebar_second' => '#sidebar-second',
),
// OPTIONAL: if you want to provide an AJAX spinner
// this paht is for a default spinner path provided with this module
// @note: see the search_api_ajax.css
'spinner' => drupal_get_path('module', 'search_api_ajax') .'/spinner.gif',
// OPTIONAL: if you want to use scroll-to-top functionality when paging
// scroll target div
'scrolltarget' => '#main-content',
'scrollspeed' => 1000,
// OPTIONAL: if you want to fade search results when Ajaxing
// please set to 1 for TRUE
'fade' => 1,
'opacity' => 0.3,
);
return $settings;
}
2. OPTIONAL: customize YUI3 jquery
If you want to use your custom YUI3 logic, you can override:
theme_search_api_ajax_js()
See search_api_ajax.module

View File

@@ -0,0 +1,228 @@
/*! Copyright (c) 2010 Brandon Aaron (http://brandonaaron.net)
* Dual licensed under the MIT (MIT_LICENSE.txt)
* and GPL Version 2 (GPL_LICENSE.txt) licenses.
*
* Version: 1.1.1
* Requires jQuery 1.3+
* Docs: http://docs.jquery.com/Plugins/livequery
*/
(function($) {
$.extend($.fn, {
livequery: function(type, fn, fn2) {
var self = this, q;
// Handle different call patterns
if ($.isFunction(type))
fn2 = fn, fn = type, type = undefined;
// See if Live Query already exists
$.each($.livequery.queries, function(i, query) {
if (self.selector == query.selector && self.context == query.context && type == query.type && (!fn || fn.$lqguid == query.fn.$lqguid) && (!fn2 || fn2.$lqguid == query.fn2.$lqguid))
// Found the query, exit the each loop
return ( q = query) && false;
});
// Create new Live Query if it wasn't found
q = q || new $.livequery(this.selector, this.context, type, fn, fn2);
// Make sure it is running
q.stopped = false;
// Run it immediately for the first time
q.run();
// Contnue the chain
return this;
},
expire: function(type, fn, fn2) {
var self = this;
// Handle different call patterns
if ($.isFunction(type))
fn2 = fn, fn = type, type = undefined;
// Find the Live Query based on arguments and stop it
$.each($.livequery.queries, function(i, query) {
if (self.selector == query.selector && self.context == query.context && (!type || type == query.type) && (!fn || fn.$lqguid == query.fn.$lqguid) && (!fn2 || fn2.$lqguid == query.fn2.$lqguid) && !this.stopped)
$.livequery.stop(query.id);
});
// Continue the chain
return this;
}
});
$.livequery = function(selector, context, type, fn, fn2) {
this.selector = selector;
this.context = context;
this.type = type;
this.fn = fn;
this.fn2 = fn2;
this.elements = [];
this.stopped = false;
// The id is the index of the Live Query in $.livequery.queries
this.id = $.livequery.queries.push(this) - 1;
// Mark the functions for matching later on
fn.$lqguid = fn.$lqguid || $.livequery.guid++;
if (fn2)
fn2.$lqguid = fn2.$lqguid || $.livequery.guid++;
// Return the Live Query
return this;
};
$.livequery.prototype = {
stop: function() {
var query = this;
if (this.type)
// Unbind all bound events
this.elements.unbind(this.type, this.fn);
else if (this.fn2)
// Call the second function for all matched elements
this.elements.each(function(i, el) {
query.fn2.apply(el);
});
// Clear out matched elements
this.elements = [];
// Stop the Live Query from running until restarted
this.stopped = true;
},
run: function() {
// Short-circuit if stopped
if (this.stopped)
return;
var query = this;
var oEls = this.elements, els = $(this.selector, this.context), nEls = els.not(oEls);
// Set elements to the latest set of matched elements
this.elements = els;
if (this.type) {
// Bind events to newly matched elements
nEls.bind(this.type, this.fn);
// Unbind events to elements no longer matched
if (oEls.length > 0)
$.each(oEls, function(i, el) {
if ($.inArray(el, els) < 0)
$.event.remove(el, query.type, query.fn);
});
}
else {
// Call the first function for newly matched elements
nEls.each(function() {
query.fn.apply(this);
});
// Call the second function for elements no longer matched
if (this.fn2 && oEls.length > 0)
$.each(oEls, function(i, el) {
if ($.inArray(el, els) < 0)
query.fn2.apply(el);
});
}
}
};
$.extend($.livequery, {
guid: 0,
queries: [],
queue: [],
running: false,
timeout: null,
checkQueue: function() {
if ($.livequery.running && $.livequery.queue.length) {
var length = $.livequery.queue.length;
// Run each Live Query currently in the queue
while (length--)
$.livequery.queries[ $.livequery.queue.shift()].run();
}
},
pause: function() {
// Don't run anymore Live Queries until restarted
$.livequery.running = false;
},
play: function() {
// Restart Live Queries
$.livequery.running = true;
// Request a run of the Live Queries
$.livequery.run();
},
registerPlugin: function() {
$.each(arguments, function(i, n) {
// Short-circuit if the method doesn't exist
if (!$.fn[n])
return;
// Save a reference to the original method
var old = $.fn[n];
// Create a new method
$.fn[n] = function() {
// Call the original method
var r = old.apply(this, arguments);
// Request a run of the Live Queries
$.livequery.run();
// Return the original methods result
return r;
}
});
},
run: function(id) {
if (id != undefined) {
// Put the particular Live Query in the queue if it doesn't already exist
if ($.inArray(id, $.livequery.queue) < 0)
$.livequery.queue.push(id);
}
else
// Put each Live Query in the queue if it doesn't already exist
$.each($.livequery.queries, function(id) {
if ($.inArray(id, $.livequery.queue) < 0)
$.livequery.queue.push(id);
});
// Clear timeout if it already exists
if ($.livequery.timeout)
clearTimeout($.livequery.timeout);
// Create a timeout to check the queue and actually run the Live Queries
$.livequery.timeout = setTimeout($.livequery.checkQueue, 20);
},
stop: function(id) {
if (id != undefined)
// Stop are particular Live Query
$.livequery.queries[id].stop();
else
// Stop all Live Queries
$.each($.livequery.queries, function(id) {
$.livequery.queries[id].stop();
});
}
});
// Register core DOM manipulation methods
$.livequery.registerPlugin('append', 'prepend', 'after', 'before', 'wrap', 'attr', 'removeAttr', 'addClass', 'removeClass', 'toggleClass', 'empty', 'remove', 'html');
// Run Live Queries when the Document is ready
$(function() {
$.livequery.play();
});
})(jQuery);

View File

@@ -0,0 +1,8 @@
#search-api-ajax-spinner {
width: 100%;
position: absolute;
top: 0;
left: 0;
text-align: center;
padding-top: 150px;
}

View File

@@ -0,0 +1,12 @@
name = Search ajaxified
description = "Ajaxifies Search API pages with jQuery Livequery and Yahoo! iFrame."
dependencies[] = search_api
core = 7.x
package = Search
; Information added by drupal.org packaging script on 2012-07-02
version = "7.x-1.x-dev"
core = "7.x"
project = "search_api_ajax"
datestamp = "1341225683"

View File

@@ -0,0 +1,224 @@
(function($) {
var history;
Drupal.search_api_ajax = {};
if (Drupal.settings.search_api_ajax) {
var blocks = Drupal.settings.search_api_ajax.blocks;
var content = Drupal.settings.search_api_ajax.content;
var regions = Drupal.settings.search_api_ajax.regions;
var spinner = Drupal.settings.search_api_ajax.spinner;
var target = Drupal.settings.search_api_ajax.scrolltarget;
var fade = Drupal.settings.search_api_ajax.fade;
var opacity = Drupal.settings.search_api_ajax.opacity;
var speed = Drupal.settings.search_api_ajax.scrollspeed;
// notice the "search_api_ajax_path" instead of
// "search_api_ajax.path" for magic reasons
var ajaxPath = Drupal.settings.search_api_ajax_path;
var qPath = Drupal.settings.search_api_ajax_qpath;
var isView = Drupal.settings.search_api_ajax.view;
// initialize listeners
Drupal.search_api_ajax.initialize = function() {
if (content) {
Drupal.search_api_ajax.ajax(content);
}
if (blocks) {
for (var block in blocks) {
Drupal.search_api_ajax.ajax(blocks[block]);
}
}
};
// extract url for ajax history
Drupal.search_api_ajax.url_to_state = function(url) {
var state = '';
if (isView) {
var query = Drupal.search_api_ajax.get_url_state(url)["query"];
}
state = url.replace(new RegExp('^.*' + Drupal.settings.basePath + ajaxPath + '/' + '?'), '');
if (query) {
state = query + state.replace('?query=' + query, '');
}
else {
state = state.replace('?query=', '');
state = state.replace('?', '&');
}
return state;
};
Drupal.search_api_ajax.get_url_state = function(url) {
var vars = [], hash;
var hashes = url.slice(url.indexOf('?') + 1).split('&');
for (var i = 0; i < hashes.length; i++) {
hash = hashes[i].split('=');
vars.push(hash[0]);
vars[hash[0]] = hash[1];
}
return vars;
}
// prepare and perform ajax search request
Drupal.search_api_ajax.request_callback = function(state) {
if (content) {
if (fade) {
$(content + ':first').fadeTo('fast', opacity);
}
if (spinner) {
$('#content').append('<div id="search-api-ajax-spinner"><img class="spinner" src="' + Drupal.settings.basePath + spinner + '" /></div>')
}
}
// Scroll back to top, when top is out of view. Inspired by views module.
if (target) {
var offset = $(target).offset();
var scrollTarget = target;
while ($(scrollTarget).scrollTop() == 0 && $(scrollTarget).parent()) {
scrollTarget = $(scrollTarget).parent()
}
if (offset.top - 10 < $(scrollTarget).scrollTop()) {
$(scrollTarget).animate({
scrollTop: (offset.top - 10)
}, speed);
}
}
// post ajax, read json
var keysPath = '/' + state;
if (isView) {
keysPath = '?query=' + state;
}
$.post(Drupal.settings.basePath + 'search_api_ajax/' + ajaxPath + keysPath, {
js: 1
}, Drupal.search_api_ajax.response_callback, 'json');
};
// update search page with ajax, based on the json we read
Drupal.search_api_ajax.response_callback = function(data) {
if (content) {
if (fade) {
$(content + ':first').fadeTo('fast', 1);
}
if (spinner) {
$('#search-api-ajax-spinner').remove();
}
}
for (var setting in data.settings) {
Drupal.settings[setting] = data.settings[setting];
}
var list = [];
// we have to add the new blocks, that have come into existence
// @see search_api_ajax.pages.inc where we add this blocks variable
if (data.blocks) {
for (var new_block in data.blocks) {
blocks[new_block] = data.blocks[new_block];
}
}
// schedule items for removal to reduce page jumpiness.
if (blocks) {
for (var block in blocks) {
list.push($(blocks[block]));
}
for (var i = 0, l = list.length; i < l; i++) {
list[i].remove();
}
}
for (var region in data.regions) {
if (region == 'search_api_ajax') {
if (content) {
$(content + ':first').html(data.regions[region]);
}
}
else {
for (var block in data.regions[region]) {
if (regions[region] && blocks[block]) {
$(regions[region]).append(data.regions[region][block]);
}
}
}
}
// re-attach Drupal behaviors for whole document
Drupal.attachBehaviors('body');
};
Drupal.search_api_ajax.navigate = function(url) {
if (url !== undefined) {
YUI().use('history', function(Y) {
history.add({
q: Drupal.search_api_ajax.url_to_state(url)
});
});
}
return false;
};
Drupal.search_api_ajax.ajax = function(selector) {
// observe regular facet and sorts links ^ starts with * contains
// check two paths: ^basePath/ajaxPath OR ^search_api_ajax/basePath/ajaxPath
// @see http://api.jquery.com/category/selectors/attribute-selectors/
// Create an array of selectors for readability.
var selectors = [selector + ' a[href^="' + Drupal.settings.basePath + ajaxPath + '"]', selector + ' a[href^="' + Drupal.settings.basePath + 'search_api_ajax/' + ajaxPath + '"]'];
$(selectors.join(', ')).livequery('click', function() {
return Drupal.search_api_ajax.navigate($(this).attr('href'));
});
// Add support for facetapi checkboxes widget.
// Unbind facetapi click event.
$(selector + ' .facetapi-checkbox').unbind('click');
$(selector + ' .facetapi-checkbox').livequery('click', function() {
return Drupal.search_api_ajax.navigate($(this).next('a').attr('href'));
})
// observe search keys forms (or views input forms, must be custom set)
$(selector + ' form[action^="' + Drupal.settings.basePath + ajaxPath + '"], ' + selector + ' form[action^="' + Drupal.settings.basePath + 'search_api_ajax/' + ajaxPath + '"]').livequery('submit', function() {
return Drupal.search_api_ajax.navigate($(this).find('input[name*="keys"]').val());
});
// observe facet range sliders
$(selector + ' .search-api-ranges-widget form[action^="' + Drupal.settings.basePath + ajaxPath + '"], ' + selector + ' .search-api-ranges-widget form[action^="' + Drupal.settings.basePath + 'search_api_ajax/' + ajaxPath + '"]').livequery('submit', function() {
var separator = '?';
if ($(this).find('input[name="range-ajax-target"]').val().indexOf("?") !== -1) {
separator = '&';
}
// add a filter in the form of &f[n]=field_name:[A B]
// instead of actually knowing what "n" is, we just f[]
// @todo Facet API can have different 'f', how to know which?
var addFilter = 'f[]=' + $(this).find('input[name="range-field"]').val() + ':' + '[' + $(this).find('input[name="range-from"]').val() + ' TO ' + $(this).find('input[name="range-to"]').val() + ']';
return Drupal.search_api_ajax.navigate($(this).find('input[name="range-ajax-target"]').val() + separator + addFilter);
});
};
}
// we initiate YUI3's History extension
YUI().use('history', function(Y) {
// initialize
history = new Y.HistoryHash();
if (history.get('q')) {
Drupal.search_api_ajax.request_callback(history.get('q'));
}
// listen to changes
// @todo when going from /page#q= to /page it should also trigger
Y.on('history:change', function(e) {
var changed = e.changed;
if (changed.q) {
Drupal.search_api_ajax.request_callback(history.get('q'));
}
});
});
Drupal.behaviors.search_api_ajax = {
attach: function(context, settings) {
// initialize livequery() event only if there is an active search
// only needed for search api pages, not for views paths
if (Drupal.search_api_ajax.url_to_state(window.location.href) != '' || isView === 1) {
Drupal.search_api_ajax.initialize();
}
}
};
})(jQuery);

View File

@@ -0,0 +1,258 @@
<?php
/**
* @file AJAXifies the Search API search pages, links, ranges, sorts and forms.
*/
/**
* Implements hook_search_api_ajax_settings().
*/
function search_api_ajax_search_api_ajax_settings() {
global $theme_key;
$settings = array();
// get all drupal blocks
$settings['blocks'] = &drupal_static(__FUNCTION__);
if (!isset($settings['blocks'])) {
$blocks = array();
// Drupal blocks
// @todo cache this?
$regions = system_region_list($theme_key);
foreach ($regions as $region_key => $region_name) {
$settings['regions'][] = $region_key;
$block_list = block_list($region_key);
// remove inactive blocks (status=0)
foreach ($block_list as $key => $block) {
if ($block->status == 0) {
unset($block_list[$key]);
}
}
$blocks = array_merge(block_list($region_key), $blocks);
if (module_exists('context')) {
$blocks = array_merge(context_get_plugin('reaction', 'block')->block_list($region_key), $blocks);
}
}
$modules = search_api_ajax_modules();
foreach ($blocks as $block) {
if (in_array($block->module, $modules)) {
// facetapi block names are strtolowered in html, so do same here
if (in_array($block->module, array(
'facetapi',
'facetapi_tagcloud'
))) {
$block->delta = strtolower($block->delta);
}
$settings['blocks'][$block->module . '_' . $block->delta] = str_replace('_', '-', '#block-' . $block->module . '-' . $block->delta);
}
}
}
// need to make the current search api page path available as jQuery setting
// @see search_api_ajax.js
$current_search = search_api_current_search();
foreach ($current_search as $key => $search) {
// break on facet blocks - $path is only useful for pages, avoid blocks
if (strpos($key, 'facets_block') !== FALSE || arg(0) == 'admin') {
break;
}
$path_parts = explode(':', $key);
// is it a view path or a search_api_page?
// views paths have 3 parts, search pages only 2
if ($path_parts[0] == 'search_api_views') {
$trail = menu_set_active_trail();
// process last entry
end($trail);
$key = key($trail);
$views_path = isset($trail[$key]['link_path']) ? $trail[$key]['link_path'] : $trail[$key]['path'];
$path = search_api_ajax_get_views_path($views_path);
$settings['view'] = 1;
}
else {
$path = $path_parts[1];
$settings['view'] = 0;
}
if (!empty($path)) {
// needed to add current page path to ajax
drupal_add_js(array('search_api_ajax_path' => $path), 'setting');
}
$settings['path'] = $path;
}
return $settings;
}
/**
* Implementation of hook_menu().
*/
function search_api_ajax_menu() {
$items = array();
// during uninstallation, this would lead to a fatal error otherwise.
if (module_exists('search_api_page')) {
foreach (search_api_page_load_multiple(FALSE, array('enabled' => TRUE)) as $page) {
$items['search_api_ajax/' . $page->path] = array(
'title' => $page->name,
'description' => $page->description ? $page->description : '',
'page callback' => 'search_api_ajax_proxy',
'page arguments' => array((string)$page->id),
'access arguments' => array('access search_api_page'),
'type' => MENU_CALLBACK,
'file' => 'search_api_ajax.pages.inc',
);
}
}
// similarly, walk through search_api_views with a path (pages)
if (module_exists('search_api_views') && function_exists('views_get_enabled_views')) {
foreach (views_get_enabled_views() as $view) {
if (strpos($view->base_table, 'search_api_index') !== FALSE) {
foreach ($view->display as $display_name => $display) {
if (isset($display->display_options['path']) && !(empty($display->display_options['path']))) {
$items['search_api_ajax/' . $display->display_options['path']] = array(
'title' => isset($display->display_title) ? $display->display_title : '',
'description' => (string)$view->human_name,
'page callback' => 'search_api_ajax_proxy_views',
'page arguments' => array(
(string)$view->name,
(string)$display_name
),
'access arguments' => array('access content'),
'type' => MENU_CALLBACK,
'file' => 'search_api_ajax.pages.inc',
);
}
}
}
}
}
return $items;
}
/**
* Returns the list of modules whose blocks are search api-related.
*
* @see search_api_ajax_proxy()
*/
function search_api_ajax_modules() {
static $modules = NULL;
if (is_null($modules)) {
$modules = array(
'search_api_facets',
'search_api_ranges',
'search_api_sorts',
'search_api_widgets',
'facetapi',
'facetapi_tagcloud',
);
drupal_alter('search_api_ajax_modules', $modules);
}
return $modules;
}
/**
* Implementation of hook_preprocess_page().
*
* Adds JavaScript files and settings. To successfully configure this module,
* another module must implement hook_search_api_ajax_settings(), which must
* return an array with the required keys "content", "blocks", "regions" and
* the optional key "spinner".
*
* "content" must be the CSS selector for the HTML node in which the page
* content is displayed. In the Zen theme, this is '#content-area'.
*
* "blocks" must be a map between the block keys and the CSS selectors for
* the blocks. Block keys follow the pattern: MODULE_DELTA. In the Zen theme,
* this may be: array('node_0' => '#block-node-0', ...). You need only do this
* for search-related blocks. If you don't know your blocks, run:
*
* <pre>
* $modules = search_api_ajax_modules();
* foreach ($modules as $module) {
* if (module_exists($module)) {
* if ($list = module_invoke($module, 'block', 'list')) {
* foreach (array_keys($list) as $delta) {
* print $module .'_'. $delta;
* }
* }
* }
* }
* </pre>
*
* "regions" must be a map between the theme regions and the CSS selectors
* for the regions. In the Zen theme, this may be: array('content_top' =>
* '.region-content-top'). If you don't know your theme's regions, run:
* <code>system_region_list('mytheme');</code>
*
* (Optional) "spinner" is the path to an animated image to be displayed
* while content is loading via AJAX, e.g.: <code>base_path() .
* drupal_get_path('module', 'mymodule') .'/images/spinner.gif'</code>
*
* @see http://developer.yahoo.com/yui/history/
*/
function search_api_ajax_preprocess_page(&$vars, $hook) {
if (!search_api_current_search()) {
return;
}
drupal_add_css(drupal_get_path('module', 'search_api_ajax') . '/search_api_ajax.css');
drupal_add_js(array('search_api_ajax' => module_invoke_all('search_api_ajax_settings')), 'setting');
drupal_add_js(drupal_get_path('module', 'search_api_ajax') . '/jquery.livequery.js', array('scope' => 'footer'));
if (module_exists('libraries') && $library = libraries_get_path('yui')) {
drupal_add_js($library . '/build/yui/yui-min.js', array('scope' => 'footer'));
}
else {
drupal_add_js('http://yui.yahooapis.com/3.5.1/build/yui/yui-min.js', 'external');
}
drupal_add_js(drupal_get_path('module', 'search_api_ajax') . '/search_api_ajax.js', array('scope' => 'footer'));
}
/**
* Collects debug data to send to the browser with the AJAX response.
*
* @param mixed $data Debug data you want to send to the browser.
*/
function search_api_ajax_debug($data = NULL) {
static $debug = array();
if (isset($data)) {
$debug[] = $data;
}
return $debug;
}
/**
* Get the actual views path
* Filling in '%' arguments in the path with the correct values from arg()
*
* @param string $views_path
* The views page path, e.g. 'mynodes', 'mynodes/%'
*
* @param int $skip
* The number of arguments to skip (usually only needed on
* search_api_ajax/* pages).
*/
function search_api_ajax_get_views_path($views_path, $skip = 0) {
$path = array();
$current_path = arg();
// fill in % paths: we know the views_path, which may contain % arguments
// so we need to fill in those % with the current page from arg()
// @todo is there a 'Drupal way' to do this?
$path = explode('/', $views_path);
foreach (arg(NULL, $views_path) as $key => $piece) {
if ($piece == '%') {
$path[$key] = $current_path[$key + $skip];
}
}
$path = implode('/', $path);
return $path;
}

View File

@@ -0,0 +1,123 @@
<?php
/**
* Checks incoming AJAX requests for Search API pages paths
*/
function search_api_ajax_proxy($id, $keys = NULL) {
$page = search_api_page_load((int)$id);
if (!$page) {
return MENU_NOT_FOUND;
}
$return = menu_execute_active_handler($page->path . '/' . $keys, FALSE);
search_api_ajax_return_json($return);
}
/**
* Checks incoming AJAX requests for Search API views paths
*/
function search_api_ajax_proxy_views($name, $display, $keys = NULL) {
$view = views_get_view($name);
if (!$view) {
return MENU_NOT_FOUND;
}
$path = search_api_ajax_get_views_path($view->display[$display]->display_options['path'], 1);
if ($keys) {
$path = $path . '/' . $keys;
}
$return = menu_execute_active_handler($path, FALSE);
search_api_ajax_return_json($return);
}
/**
* Performs a search request and returns page & block content html as JSON
*
* If the incoming request is not an AJAX request, user/bot is redirected
* to the non-Ajax URL.
*
* @see search_api_ajax_modules()
*/
function search_api_ajax_return_json($return) {
// check request source type: non-ajax is redirect back to non-ajax URL
if (!isset($_SERVER['HTTP_X_REQUESTED_WITH']) || strtolower($_SERVER['HTTP_X_REQUESTED_WITH']) != 'xmlhttprequest') {
$params = drupal_get_query_parameters();
$path = str_replace('search_api_ajax/', '', $_GET['q']);
drupal_goto($path, array('query' => $params), 301);
exit ;
}
if (is_int($return)) {
switch ($return) {
case MENU_NOT_FOUND :
drupal_add_http_header('Status', '404 Not Found');
break;
case MENU_ACCESS_DENIED :
drupal_add_http_header('Status', '403 Forbidden');
break;
case MENU_SITE_OFFLINE :
drupal_add_http_header('Status', '503 Service unavailable');
break;
}
}
elseif (isset($return)) {
global $theme;
if (!isset($theme)) {
init_theme();
}
// render JSON (views are already rendered)
if (is_array($return)) {
$return = drupal_render($return);
}
$json = array('regions' => array('search_api_ajax' => $return));
// add new blocks
$blocks = array();
// Drupal blocks
// @todo cache this?
$regions = system_region_list($theme);
foreach ($regions as $region_key => $region_name) {
$settings['regions'][] = $region_key;
$block_list = block_list($region_key);
// remove inactive blocks (status=0)
foreach ($block_list as $key => $block) {
if ($block->status == 0) {
unset($block_list[$key]);
}
}
$blocks = array_merge(block_list($region_key), $blocks);
if (module_exists('context')) {
$blocks = array_merge(context_get_plugin('reaction', 'block')->block_list($region_key), $blocks);
}
}
$modules = search_api_ajax_modules();
foreach ($blocks as $block) {
if (in_array($block->module, $modules)) {
$rendered_block = _block_render_blocks(array($block));
$rendered_block = _block_get_renderable_array($rendered_block);
$json['regions'][$block->region][$block->module . '_' . $block->delta] = drupal_render($rendered_block);
// new blocks may have come into existence, we notify about them
// otherwise they would never be displayed to the user
// @see search_api_ajax.js
$block_delta = strtolower($block->delta);
$json['blocks'][$block->module . '_' . $block->delta] = str_replace('_', '-', '#block-' . $block->module . '-' . $block->delta);
}
}
// merge all scopes and settings
$javascript = drupal_add_js(NULL, NULL, NULL);
$scopes = call_user_func_array('array_merge_recursive', $javascript);
$json['settings'] = call_user_func_array('array_merge_recursive', array($scopes['data']));
$json['debug'] = search_api_ajax_debug();
drupal_add_http_header('Content-Type', 'application/json; charset=utf-8');
print drupal_json_encode($json);
}
}

Binary file not shown.

After

Width:  |  Height:  |  Size: 6.7 KiB