Club Drupal

                    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.

Node export README

CONTENTS OF THIS FILE

----------------------

  * Introduction

  * Installation

  * Configuration

  * Usage

  * Node export features tips

INTRODUCTION

------------

This module allows users to export nodes and then import it into another

Drupal installation, or on the same site.

This module allows user to export/import nodes if they have the 'export nodes'

or 'export own nodes' permission, have node access to view the node and create

the node type, and the node type is not omitted in node export's settings. The

module does not check access to the filter formats used by the node's fields,

please keep this in mind when assigning permissions to user roles.

Maintainer: Daniel Braksator (http://drupal.org/user/134005)

Project page: http://drupal.org/project/node_export.

Note: this module was originally built upon code from the node_clone module

maintained by Peter Wolanin (http://drupal.org/user/49851) at 

http://drupal.org/project/node_clone which was derived from code posted by

Steve Ringwood (http://drupal.org/user/12856) at 

http://drupal.org/node/73381#comment-137714

Features integration, relations, and UUID initially developed by Tushar Mahajan

(http://drupal.org/user/398572).

Significant improvements, file handling, and extra functionality pioneered by 

James Andres (http://drupal.org/user/33827).

INSTALLATION

------------

1. Copy node_export folder to modules directory (usually sites/all/modules).

2. At admin/build/modules enable the Node export module in the Node export 

   package.

3. Enable any other modules in the Node export package that tickle your fancy.

For detailed instructions on installing contributed modules see:

http://drupal.org/documentation/install/modules-themes/modules-7

CONFIGURATION

-------------

1. Enable permissions at admin/user/permissions.

   Security Warning: Users with the permission "use PHP to import nodes"

   will be able to change nodes as they see fit before an import, as well as 

   being able to execute PHP scripts on the server.  It is advisable not to

   give this permission to a typical node author, only the administrator or

   developer should use this feature.  You may even like to turn this module

   off when it is no longer required.

   This module does not check access to the filter formats used by the node's

   fields, please keep this in mind when assigning permissions to user roles.

2. Configure module at admin/settings/node_export.

USAGE

-----

1. To export nodes, either:

   a) Use the 'Node export' tab on a node page.

   b) Use the Find content page (admin/content) to filter the nodes you 

      wish to export and then choose 'Node export' under the 'Update options'.

   c) Use Drush: http://drupal.org/project/drush

   d) Create a Feature (see tips below) http://drupal.org/project/features

   e) Create a View of nodes and use the Views Bulk Operations (VBO) module

      http://drupal.org/project/views_bulk_operations

2. To import nodes that were exported with Node export, either:

   a) Use the form at 'Node export: import' under 'Add content'

      (node/add/node_export).

   b) Use Drush: http://drupal.org/project/drush

   c) Using your created Feature.

   d) For advanced imports if you are familiar with the Feeds module, enable

      Node export feeds module to use with the Feeds import interface 

      http://drupal.org/project/feeds

NODE EXPORT FEATURES TIPS

-------------------------

Regarding the Node export features module which integrates with the Features

module, any nodes to be used with this must have a UUID (universally unique 

ID).  To export older nodes that don't have UUID make sure you have selected

the content type and click on 'create missings uuids' from 

'admin/settings/uuid' under the fieldset 'Synchronize'.  Then you should be 

able to see more nodes under the feature component, If you don't see the node

export component, that means no nodes has been configured with UUID.

<?php

/**

 * @file

 * The Node export Drupal format handler.

 *

 * Adds Drupal var export format to Node export.

 */

/**

 * Export callback.

 */

function node_export_drupal_export($nodes, $format) {

  require_once DRUPAL_ROOT . '/includes/utility.inc';

  return drupal_var_export($nodes);

}

/**

 * Import callback.

 */

function node_export_drupal_import($code_string) {

  if (substr(ltrim($code_string), 0, 6) == "array(") {

    $nodes = eval('return ' . $code_string . ';');

    if (is_array($nodes)) {

      return node_export_drupal_decode_objects($nodes);

    }

  }

}

/**

 * Recursively convert arrays back to objects.

 *

 * This is only for backwards compatibility with the deprecated node_code format.

 */

function node_export_drupal_decode_objects($array) {

  foreach ($array as $k => $v) {

    if (is_array($v)) {

      $array[$k] = node_export_drupal_decode_objects($v);

    }

  }

  if (isset($array['#_export_node_encode_object'])) {

    unset($array['#_export_node_encode_object']);

    $array = (object)$array;

  }

  return $array;

}

/**

 * Callback for actions.

 */

function node_export_drupal_action_form($context, &$form_state) {

  return node_export_action_form($context, $form_state, 'drupal');

}

<?php

/**

 * @file

 * The Node export DSV format handler.

 *

 * Adds configurable DSV format to Node export.

 */

/**

 * Settings callback.

 */

function node_export_dsv_settings($form, $form_state) {

  $settings['dsv'] = array(

    '#type' => 'fieldset',

    '#title' => t('DSV format settings'),

    '#description' => t(

     'Select how your DSV output will be formatted - this must be configured the

     same on both sites.  By default this is configured to RFC4180 CSV format

     where the delimiter is a comma (,), the enclosure is a double-quote ("),

     and the seperator is CRLF (\r\n).  Not all configurations may be possible,

     use wisely.  Enclosure will only be used to escape values that contain any

     of the configured strings.  Additionally single-quotes will be used to

     escape values that are equivalent to reserved words (NULL, TRUE, FALSE).'

    ),

    '#collapsible' => TRUE,

    '#collapsed' => TRUE,

  );

  $settings['dsv']['node_export_dsv_delimiter'] = array(

    '#type' => 'textfield',

    '#title' => t('Value delimiter'),

    '#size' => 5,

    '#maxlength' => 255,

    '#default_value' => variable_get('node_export_dsv_delimiter', ','),

    '#required' => TRUE,

  );

  $settings['dsv']['node_export_dsv_enclosure'] = array(

    '#type' => 'textfield',

    '#title' => t('Escape enclosure'),

    '#size' => 5,

    '#maxlength' => 255,

    '#default_value' => variable_get('node_export_dsv_enclosure', '"'),

    '#required' => TRUE,

  );

  $settings['dsv']['node_export_dsv_seperator'] = array(

    '#type' => 'textfield',

    '#title' => t('Record seperator'),

    '#size' => 5,

    '#maxlength' => 255,

    '#default_value' => variable_get('node_export_dsv_seperator', '\r\n'),

    '#required' => TRUE,

  );

  $settings['dsv']['node_export_dsv_escape_eol'] = array(

    '#type' => 'checkbox',

    '#title' => t('Always escape values containing line breaks'),

    '#default_value' => variable_get('node_export_dsv_escape_eol', 1),

    '#description' => t('This is to overcome problems where Windows injects CRLF line breaks.'),

  );

  return $settings;

}

function node_export_dsv_string($string) {

  $replace = array(

   '\n' => "\n",

   '\r' => "\r",

   '\t' => "\t",

   '\v' => "\v",

   '\e' => "\e",

   '\f' => "\f",

  );

  return str_replace(array_keys($replace), array_values($replace), $string);

}

/**

 * Export callback.

 */

function node_export_dsv_export($nodes, $format) {

  $delimiter = node_export_dsv_string(variable_get('node_export_dsv_delimiter', ','));

  $enclosure = node_export_dsv_string(variable_get('node_export_dsv_enclosure', '"'));

  $seperator = node_export_dsv_string(variable_get('node_export_dsv_seperator', '\r\n'));

  $escape_eol = variable_get('node_export_dsv_escape_eol', 1);

  return node_export_dsv_encode($nodes, $delimiter, $enclosure, $seperator, $escape_eol);

}

/**

 * Build DSV string.

 */

function node_export_dsv_encode($nodes, $delimiter, $enclosure, $seperator, $escape_eol) {

  $encoded_nodes = array();

  $dsv_lines = array();

  $node_keys = array();

  foreach (array_keys($nodes) as $node_key) {

    $new_node_key = 'node_' . $node_key;

    $node_keys[] = $new_node_key;

    node_export_dsv_encode_node($encoded_nodes, $new_node_key, $nodes[$node_key]);

  }

  $dsv_lines['node_export_dsv_header'] = array_keys($encoded_nodes);

  foreach (array_keys($encoded_nodes) as $header_value) {

    $encoded_nodes[$header_value] = array_merge(array_fill_keys($node_keys, NULL), $encoded_nodes[$header_value]);

    foreach (array_keys($encoded_nodes[$header_value]) as $encoded_node_key) {

      $dsv_lines[$encoded_node_key][$header_value] = $encoded_nodes[$header_value][$encoded_node_key];

    }

  }

  return node_export_dsv_array_to_dsv($dsv_lines, $delimiter, $enclosure, $seperator, $escape_eol);

}

/**

 * Process a node and update $header and $encoded_nodes accordingly.

 */

function node_export_dsv_encode_node(&$encoded_nodes, $node_key, $var, $parent = NULL) {

  foreach ($var as $k => &$v) {

    // Get the new header value.

    $header_value = node_export_dsv_encode_header_value($parent, $var, $k);

    if (is_object($v) || is_array($v)) {

      // Recurse through the structure.

      node_export_dsv_encode_node($encoded_nodes, $node_key, $v, $header_value);

    }

    else {

      // Create a safe text version of this value and store it against the header using a safe key.

      $encoded_nodes[$header_value][$node_key] = node_export_dsv_encode_sanitize_value($v);

    }

  }

}

/**

 * Encode a value.

 */

function node_export_dsv_encode_sanitize_value($var) {

    if (is_numeric($var)) {

      return $var;

    }

    elseif (is_bool($var)) {

      return ($var ? 'TRUE' : 'FALSE');

    }

    elseif (is_null($var)) {

      return 'NULL';

    }

    elseif (is_string($var) && !empty($var)) {

      // Single-quote strings that could be confused for null or boolean.

      if (in_array(strtoupper($var), array('TRUE', 'FALSE', 'NULL'))) {

        $var = "'" . $var . "'";

      }

      return $var;

    }

    else {

      return '';

    }

}

/**

 * Decode a value.

 */

function node_export_dsv_decode_sanitize_value($var) {

  // Allow numeric, bool, and null values to pass right back as is.

  if (is_numeric($var) || is_bool($var) || is_null($var)) {

    return $var;

  }

  // Allow the special case strings back as is.

  elseif (in_array(strtoupper($var), array("'TRUE'", "'FALSE'", "'NULL'"))) {

    return $var;

  }

  // Assume this is a string.

  return "'" . str_replace("'", "\'", $var) . "'";

}

/**

 * Create header value from $parents, $var, and $k.

 */

function node_export_dsv_encode_header_value($parents, $var, $k) {

  if (is_null($parents)) {

    // Special case; on the first level do not prefix the key.

    $header_value = $k;

  }

  elseif (is_object($var)) {

    $header_value = $parents . "->" . $k;

  }

  elseif (is_array($var)) {

    $header_value = $parents . "['" . $k . "']";

  }

  return $header_value;

}

/**

 * Import callback.

 */

function node_export_dsv_import($code_string) {

  $delimiter = node_export_dsv_string(variable_get('node_export_dsv_delimiter', ','));

  $enclosure = node_export_dsv_string(variable_get('node_export_dsv_enclosure', '"'));

  $seperator = node_export_dsv_string(variable_get('node_export_dsv_seperator', '\r\n'));

  return node_export_dsv_decode($code_string, $delimiter, $enclosure, $seperator);

}

/**

 *  Interpret a DSV string.

 */

function node_export_dsv_decode($code_string, $delimiter, $enclosure, $seperator) {

  // Get array data from DSV.

  $array = @node_export_dsv_dsv_to_array($code_string, $delimiter, $enclosure, $seperator);

  // If the first two rows are of equal length, we can assume this is a DSV.

  // Also checks there are a decent number of fields.

  if (!empty($array[0]) && !empty($array[1]) && count($array[0]) > 10 && count($array[0]) == count($array[1])) {

    $nodes = array();

    // Assume row 0 is the header, and the rest of the rows are the nodes.

    $header = array_shift($array);

    // Build the nodes.

    foreach ($array as &$row) {

      $node = (object)array();

      foreach ($row as $key => $item) {

        $item = node_export_dsv_decode_sanitize_value($item);

        eval('$node->' . $header[$key] . ' = ' . $item . ';');

      }

      $nodes[] = $node;

    }

    return $nodes;

  }

}

/**

 *  Encode DSV.

 */

function node_export_dsv_array_to_dsv($array, $delimiter, $enclosure, $seperator, $escape_eol) {

  $lines = array();

  foreach ($array as $line) {

    $out_item = array();

    foreach ($line as $item) {

      if (stripos($item, $enclosure) !== FALSE) {

        $item = str_replace($enclosure, $enclosure . $enclosure, $item);

      }

      if (

        (stripos($item, $delimiter) !== FALSE)

        || (stripos($item, $enclosure) !== FALSE)

        || (stripos($item, $seperator) !== FALSE)

        || ($escape_eol && stripos($item, "\n") !== FALSE)

      ) {

        $item = $enclosure . $item . $enclosure;

      }

      $out_item[] = $item;

    }

    $lines[] = implode($delimiter, $out_item);

  }

  return implode($seperator, $lines);

}

/**

 *  Decode DSV.

 */

function node_export_dsv_dsv_to_array($string, $delimiter, $enclosure, $seperator) {

  $lines = array();

  $out_item = array();

  $count = strlen($string);

  $escape = FALSE;

  $double_escape = FALSE;

  $position = 0;

  $i = 0;

  $seperators = str_split($seperator);

  while ($i < $count) {

    $c = $string[$i];

    // Determine whether this is an EOL.

    $is_eol = TRUE;

    for ($j = 0; $j < count($seperators); $j++) {

      if (!isset($string[$i + $j]) || $string[$i + $j] != $seperators[$j]) {

        $is_eol = FALSE;

        break;

      }

    }

    if ($is_eol) {

      if ($escape) {

        $out_item[$position] .= $c;

      }

      else {

        $i += count($seperators);

        $lines[] = $out_item;

        $out_item = array();

        $position = 0;

        continue;

      }

    }

    elseif ($c == $delimiter) {

      if ($escape) {

        $out_item[$position] .= $c;

      }

      else {

        if ($string[$i - 1] == $delimiter) {

          $out_item[$position] .= '';

        }

        $position++;

        $escape = FALSE;

        $double_escape = FALSE;

      }

    }

    elseif ($c == $enclosure) {

      if ($double_escape) {

        $out_item[$position] .= $enclosure;

        $double_escape = FALSE;

      }

      if ($escape) {

        $escape = FALSE;

        $double_escape = TRUE;

      }

      else {

        $escape = TRUE;

        $double_escape = FALSE;

      }

    }

    else {

      if ($double_escape) {

        $out_item[$position] .= $enclosure;

        $double_escape = FALSE;

      }

      $out_item[$position] .= $c;

    }

    $i++;

  }

  if (!empty($out_item)) {

    $lines[] = $out_item;

  }

  return $lines;

}

/**

 * Callback for actions.

 */

function node_export_dsv_action_form($context, &$form_state) {

  return node_export_action_form($context, $form_state, 'dsv');

}

<?php

/**

 * @file

 * The Node export JSON format handler.

 *

 * Adds JSON format to Node export.

 */

/**

 * Export callback.

 */

function node_export_json_export($nodes, $format) {

  return drupal_json_encode(node_export_json_encode_objects($nodes));

}

/**

 * Import callback.

 */

function node_export_json_import($code_string) {

  return node_export_json_decode_objects(drupal_json_decode($code_string));

}

/**

 * Mark objects as being objects.

 */

function node_export_json_encode_objects($var) {

  if (is_object($var)) {

    $var = (array)$var;

    $var['#node_export_object'] = '1';

  }

  if (is_array($var)) {

    foreach ($var as $key => $value) {

      $var[$key] = node_export_json_encode_objects($value);

    }

  }

  return $var;

}

/**

 * Recursively convert arrays back to objects.

 */

function node_export_json_decode_objects($array) {

  if (is_array($array)) {

    foreach ($array as $k => $v) {

      if (is_array($v)) {

        $array[$k] = node_export_json_decode_objects($v);

      }

    }

    if (isset($array['#node_export_object'])) {

      unset($array['#node_export_object']);

      $array = (object)$array;

    }

    return $array;

  }

}

/**

 * Callback for actions.

 */

function node_export_json_action_form($context, &$form_state) {

  return node_export_action_form($context, $form_state, 'json');

}

<?php

/**

 * @file

 * The Node export serialize format handler.

 *

 * Adds serialize format to Node export.

 */

/**

 * Export callback.

 */

function node_export_serialize_export($nodes, $format) {

  return 'node_export_serialize::' . htmlspecialchars(serialize($nodes));

}

/**

 * Import callback.

 */

function node_export_serialize_import($code_string) {

  // Check for 'node_export_serialize::' at the start.

  if (substr(ltrim($code_string), 0, 23) == 'node_export_serialize::') {

    return unserialize(htmlspecialchars_decode(str_replace('node_export_serialize::', '', $code_string)));

  }

}

/**

 * Callback for actions.

 */

function node_export_serialize_action_form($context, &$form_state) {

  return node_export_action_form($context, $form_state, 'serialize');

}

<?php

/**

 * @file

 * The Node export XML format handler.

 *

 * Adds XML format to Node export.

 */

/**

 * Export callback.

 */

function node_export_xml_export($nodes, $format) {

  $xml_code = "<?xml version=\"1.0\" encoding=\"UTF-8\" ?>\n";

  $xml_code .= "<node_export created=\"" . date('r') . "\">\n";

  $xml_code .= node_export_xml_encode($nodes);

  $xml_code .= "</node_export>";

  return $xml_code;

}

/**

 * Import callback.

 */

function node_export_xml_import($code_string) {

  // Check for "<?xml" at the start.

  if (substr(ltrim($code_string), 0, 5) == "<?xml") {

    // Decode the XML.

    $xml_class = new NodeExportXmlDecoder();

    $result = $xml_class->decode($code_string);

    // Convert the nodes into objects.

    if (!isset($result['success'])) {

      foreach($result as $k => $v) {

        $result[$k] = (object)$v;

      }

    }

    return $result;

  }

}

/**

 * Build XML string recursively.

 */

function node_export_xml_encode($var, $iteration = 0) {

  $xml_code = "";

  $tab = '';

  for ($i = 0; $i <= $iteration; $i++) {

    $tab = $tab . "  ";

  }

  $iteration++;

  foreach ($var as $key => $value) {

    $attributes = array();

    if (is_bool($value)) {

      $attributes['type'] = 'boolean';

    }

    elseif (is_null($value)) {

      $attributes['type'] = 'NULL';

    }

    elseif (is_object($value)) {

      if ($iteration == 1 && isset($value->nid) && isset($value->type)) {

        // Assume first-level object with a nid and type is a stdClass node.

        $key = "node";

      }

      else {

        $attributes['class'] = get_class($value);

      }

      $value = (array)$value;

    }

    if (is_array($value) && array_values($value) === $value) {

      $attributes['_numeric_keys'] = "1";

    }

    $attr_string = "";

    foreach ($attributes as $attr_name => $attr_value) {

      $attr_string .= ' ' . $attr_name . '="' . $attr_value . '"';

    }

    if (is_numeric($key)) {

      $key = "n" . $key;

    }

    $xml_code .= $tab . "<" . $key . $attr_string . ">";

    if (is_array($value)) {

      if (!empty($value)) {

        $xml_code .= "\n";

        $xml_code .= node_export_xml_encode($value, $iteration);

        if (!is_numeric($key)) {

          $xml_code .= $tab;

        }

      }

    }

    elseif (is_numeric($value)) {

      $xml_code .= $value;

    }

    elseif (is_bool($value)) {

      $xml_code .= ($value ? 'TRUE' : 'FALSE');

    }

    elseif (is_string($value)) {

      $xml_code .= htmlspecialchars($value);

    }

    $xml_code .= "</" . $key . ">\n";

  }

  return $xml_code;

}

/**

 * Class for parsing Node export XML.

 */

class NodeExportXmlDecoder {

  var $stack;

  var $output;

  function decode($code_string) {

    $parser = xml_parser_create();

    xml_set_element_handler($parser, array(&$this, 'start_handler'), array(&$this, 'end_handler'));

    xml_set_character_data_handler($parser, array(&$this, 'data_handler'));

    $this->stack = array(

      array(

        'name' => 'node_export',

        'attributes' => array(),

        'children' => array(),

        'data' => '',

      )

    );

    if (!xml_parse($parser, $code_string)) {

      $errors[] = "Node export XML import was unsuccessful, error details follow.  No nodes imported.";

      $line = xml_get_current_line_number($parser);

      $column = xml_get_current_column_number($parser);

      $error = xml_error_string(xml_get_error_code($parser));

      $errors[] = "Line " . $line . ", Column " . $column .": ". $error;

      $lines = explode("\n", $code_string, $line + 1);

      $errors[] = "<pre>". htmlspecialchars($lines[$line - 1]) ."</pre>";

      xml_parser_free($parser);

      return array(

        'success' => FALSE,

        'output' => $errors,

      );

    }

    xml_parser_free($parser);

    $tmp = $this->build($this->stack[0]);

    if (count($tmp) == 1) {

      $this->output = array_pop($tmp);

    }

    else {

      $this->output = array();

    }

    unset($this->stack);

    return $this->output;

  }

  function build($stack) {

    $result = array();

    if (count($stack['children']) > 0) {

      $keycount = array();

      foreach ($stack['children'] as $child) {

        $keycount[] = $child['name'];

      }

      if (count(array_unique($keycount)) != count($keycount)) {

        // Enumerated array.

        $children = array();

        foreach ($stack['children'] as $child) {

          $children[] = $this->build($child);

        }

      }

      else {

        // Associative array.

        $children = array();

        foreach ($stack['children'] as $child) {

          if (!empty($stack['attributes']['_NUMERIC_KEYS'])) {

            $child['name'] = intval(substr($child['name'], 1));

          }

          $children[$child['name']] = $this->build($child);

        }

      }

      $result = array_merge($result, $children);

    }

    if (count($result) == 0) {

      // An atomic value.

      $return = trim($stack['data']);

      if (isset($stack['attributes']['TYPE'])) {

        if ($stack['attributes']['TYPE'] == 'boolean') {

          return (trim($stack['data']) == 'TRUE' ? TRUE : FALSE);

        }

        elseif ($stack['attributes']['TYPE'] == 'NULL') {

          return NULL;

        }

      }

      return htmlspecialchars_decode(trim($stack['data']));

    }

    else {

      // An array or object.

      if (isset($stack['attributes']['CLASS'])) {

        $object = new $stack['attributes']['CLASS']();

        foreach ($result as $k => $v) {

          $object->$k = $v;

        }

        $result = $object;

      }

      return $result;

    }

  }

  function start_handler($parser, $name, $attributes = array()) {

    $token = array();

    $token['name'] = strtolower($name);

    $token['attributes'] = $attributes;

    $token['data'] = '';

    $token['children'] = array();

    $this->stack[] = $token;

  }

  function end_handler($parser, $name, $attributes = array()) {

    $token = array_pop($this->stack);

    $this->stack[count($this->stack) - 1]['children'][] = $token;

  }

  function data_handler($parser, $data) {

    $this->stack[count($this->stack) - 1]['data'] .= $data;

  }

}

/**

 * Callback for actions.

 */

function node_export_xml_action_form($context, &$form_state) {

  return node_export_action_form($context, $form_state, 'xml');

}

<?php

/**

 * @file

 * Documents Node export dependency's hooks for api reference.

 */

/**

 * Handle dependencies not already handled.

 *

 * Let other modules alter this - for example to only allow some users to

 * export specific nodes or types.

 *

 * @param &$handled

 *   Boolean indicating whether the dependency was handled, only set to TRUE,

 *   never explicitly set it to FALSE.  Only run code when it is already FALSE.

 * @param $node

 *   The node to handle the dependency for.

 * @param $dependency

 *   The dependency data.

 */

function hook_node_export_dependency_alter(&$handled, &$node, $dependency) {

  if (!$handled) {

    // Attempt to handle the dependency here.

    // If it's handled successfully set $handled to TRUE.

  }

}

<?php

/**

 * @file

 * Contains hook implementations for all relevant core module.

 */

/**

 * Implements hook_node_export_dependency().

 */

function node_node_export_dependency($entity, $entity_type) {

  if ($entity_type == 'node') {

    $dependencies = array();

    // The node has a 'user' dependency through the 'uid' and

    // 'revision_uid' properties.

    node_export_dependency_add($dependencies, $entity, 'user', array('uid', 'revision_uid'));

    // The node has a 'node' dependency through the 'tnid' property.

    node_export_dependency_add($dependencies, $entity, 'node', 'tnid');

    return $dependencies;

  }

}

/**

 * Implements hook_node_export_dependency()

 */

function taxonomy_node_export_dependency($entity, $entity_type) {

  if ($entity_type == 'taxonomy_term') {

    $dependencies = array();

    $terms = taxonomy_get_parents($entity->tid);

    $delta = 0;

    foreach ($terms as $tid => $term) {

      $dependencies[] = array(

        'type' => 'taxonomy_term',

        'id' => $tid,

        'property' => 'parent',

        'delta' => $delta++,

      );

    }

    return $dependencies;

  }

}

/**

 * Implements hook_node_export_dependency().

 */

function book_node_export_dependency($entity, $entity_type) {

  if ($entity_type == 'node' && !empty($entity->book)) {

    $dependencies = array();

    // Book page's root book node.

    if (!empty($entity->book['bid'])) {

       $dependencies[] = array(

         'type' => 'node',

         'id' => $entity->book['bid'],

         'property' => array(array('book', 'bid')),

       );

    }

    // Book page's immediate parent.

    if (!empty($entity->book['plid'])) {

       $parent_nid = db_query(

         'SELECT nid FROM {book} WHERE mlid = :mlid',

         array(':mlid' => $entity->book['plid'])

       )->fetchField();

       $dependencies[] = array(

         'type' => 'node',

         'id' => $parent_nid,

         'property' => array(array('book', 'plid')),

         // Recognise the relationship is not done through the entity id key.

         'relationship' => array(

           'key' => array('menu', 'mlid'),

           'value' => $entity->book['plid'],

         ),

       );

    }

    // Book page's immediate children.

    $flat = book_get_flat_menu($entity->book);

    $children = array();

    if ($entity->book['has_children']) {

      // Walk through the array until we find the current page.

      do {

        $link = array_shift($flat);

      } while ($link && ($link['mlid'] != $entity->book['mlid']));

      // Continue through the array and collect the links whose parent is this page.

      while (($link = array_shift($flat)) && $link['plid'] == $entity->book['mlid']) {

        $matches = array();

        if (preg_match('/^node\/([\d]+)$/', $link['href'], $matches)) {

          $dependencies[] = array(

            'type' => 'node',

            'id' => $matches[1],

          );

        }

      }

    }

    return $dependencies;

  }

}

/**

 * Implements hook_node_export_dependency().

 */

function og_node_export_dependency($entity, $entity_type) {

  if ($entity_type == 'node') {

    $dependencies = array();

    if (!empty($entity->og_groups)) {

      foreach (array_keys($entity->og_groups) as $delta) {

         entity_dependency_add($dependencies, $entity, 'node', array(array('og_groups', $delta)));

      }

    }

    if (!empty($entity->og_parent->nid)) {

      entity_dependency_add($dependencies, $entity, 'node', array(array('og_parent', 'nid')));

    }

    if (!empty($dependencies)) {

      return $dependencies;

    }

  }

}

/**

 * Implements hook_node_export_dependency().

 */

function field_node_export_dependency($entity, $entity_type) {

  $dependencies = array();

  list(,, $bundle_name) = entity_extract_ids($entity_type, $entity);

  $instances = field_info_instances($entity_type, $bundle_name);

  foreach ($instances as $field_name => $instance) {

    $field = field_info_field($field_name);

    foreach ($entity->{$field_name} as $langcode => $items) {

      $field_dependencies = module_invoke($field['module'], 'node_export_dependency_field', $entity_type, $entity, $field, $instance, $langcode, $items);

      // Let other modules alter dependencies for this field.

      drupal_alter('node_export_dependency_field', $field_dependencies, $entity_type, $entity, $field, $instance, $langcode, $items);

      if (!empty($field_dependencies)) {

        foreach ($field_dependencies as &$field_dependency) {

          if (empty($field_dependency['module'])) {

            $field_dependency['module'] = $field['module'];

          }

          if (empty($field_dependency['field_name'])) {

            $field_dependency['field_name'] = $field_name;

          }

          if (empty($field_dependency['langcode'])) {

            $field_dependency['langcode'] = $langcode;

          }

        }

        $dependencies = array_merge_recursive($dependencies, $field_dependencies);

      }

    }

  }

  return $dependencies;

}

/**

 * Implements hook_node_export_dependency_field().

 */

function taxonomy_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  // No need to check for the field type here, since this hook is only called

  // for the owner of this field. Taxonomy module only owns one field.

  $dependencies = array();

  node_export_dependency_add($dependencies, $items, 'taxonomy_term', 'tid');

  return $dependencies;

}

/**

 * Implements hook_node_export_dependency_field().

 */

function file_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  $dependencies = array();

  node_export_dependency_add($dependencies, $items, 'file', 'fid');

  node_export_dependency_add($dependencies, $items, 'user', 'uid');

  return $dependencies;

}

/**

 * Implements hook_node_export_dependency_field().

 */

function image_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  return file_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items);

}

/**

 * Implements hook_node_export_dependency_field().

 */

function node_reference_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  $dependencies = array();

  node_export_dependency_add($dependencies, $items, 'node', 'nid');

  return $dependencies;

}

/**

 * Implements hook_node_export_dependency_field().

 */

function user_reference_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  $dependencies = array();

  node_export_dependency_add($dependencies, $items, 'user', 'uid');

  return $dependencies;

}

/**

 * Implements hook_node_export_dependency_field().

 */

function entityreference_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  $dependencies = array();

  node_export_dependency_add($dependencies, $items, $field['settings']['target_type'], 'target_id');

  return $dependencies;

}

/**

 * Implements hook_node_export_dependency_field().

 */

function field_collection_node_export_dependency_field($entity_type, $entity, $field, $instance, $langcode, $items) {

  $dependencies = array();

  node_export_dependency_add($dependencies, $items, 'field_collection_item', 'value');

  return $dependencies;

}

name = Node export dependency (experimental)

description = Helps maintain relationships to dependent entities.  Intended to make Node export relation obsolete.

dependencies[] = node_export

dependencies[] = uuid

core = 7.x

package = "Node export"

; Information added by drupal.org packaging script on 2012-08-20

version = "7.x-3.0"

core = "7.x"

project = "node_export"

datestamp = "1345435979"

<?php

/**

 * @file

 * The Node export dependency install file.