+++ /dev/null
-use strict;
-use Module::Build;
-use Module::Build::Compat;
-
-my %arguments = (
- create_makefile_pl => 'passthrough',
- license => 'perl',
- module_name => 'DBIx::Class::Tree',
- requires => {
- 'DBIx::Class' => 0.06,
- },
- build_requires => {
- 'DBD::SQLite' => 1.11,
- },
- create_readme => 1,
- test_files => [ glob('t/*.t'), glob('t/*/*.t') ]
-);
-
-Module::Build->new(%arguments)->create_build_script();
-
+++ /dev/null
-Build.PL
-Changes
-lib/DBIx/Class/Tree.pm
-lib/DBIx/Class/Tree/AdjacencyList.pm
-lib/DBIx/Class/Tree/AdjacencyList/Ordered.pm
-Makefile.PL
-MANIFEST This list of files
-META.yml
-README
-t/01_pod.t
-t/10_adjacencylist.t
-t/11_adjacencylist_ordered.t
-t/lib/sqlite.sql
-t/lib/TreeTest.pm
-t/lib/TreeTest/Schema.pm
-t/lib/TreeTest/Schema/Node.pm
-t/var/test.db
-TODO
+++ /dev/null
----
-name: DBIx-Class-Tree
-version: 0.01000
-author:
- - 'Aran Clary Deltac <bluefeet@cpan.org>'
-abstract: Manipulate and anaylze tree structured data.
-license: perl
-resources:
- license: http://dev.perl.org/licenses/
-requires:
- DBIx::Class: 0.06
-build_requires:
- DBD::SQLite: 1.11
-provides:
- DBIx::Class::Tree:
- file: lib/DBIx/Class/Tree.pm
- version: 0.01000
- DBIx::Class::Tree::AdjacencyList:
- file: lib/DBIx/Class/Tree/AdjacencyList.pm
- DBIx::Class::Tree::AdjacencyList::Ordered:
- file: lib/DBIx/Class/Tree/AdjacencyList/Ordered.pm
-generated_by: Module::Build version 0.2805
-meta-spec:
- url: http://module-build.sourceforge.net/META-spec-v1.2.html
- version: 1.2
+++ /dev/null
-NAME
- DBIx::Class::Tree - Manipulate and anaylze tree structured data.
-
-DESCRIPTION
- The tree modules provide the tools to represent, modify, and analyze
- trees of data with DBIx::Class.
-
-COMPONENTS
- DBIx::Class::Tree::AdjacencyList - Manage a tree of data using the
- common adjacency list model.
-
- DBIx::Class::Tree::AdjacencyList::Ordered - Glue DBIx::Class::Ordered
- and DBIx::Class::Tree::AdjacencyList together.
-
-DAG
- All tree related modules must conform to have and use the basic
- traversal methods of a DAG. For the most part this just means that Tree
- modules must provide the appearance of having multiple parents per node
- (via a parents() method) but may very well never return more than one
- parent. All utility modules, such as a Visitor module, should do its
- best to never assume that a node only has one parent. There are
- situations where this is not possible - in those cases the module's
- documentation should clearly state that it is not compatible with DAGs.
-
- So far there is no Tree::DAG module, but there will be. These
- requirements are vague, and the requirements of Tree modules to be DAG
- compatible will become more defined in due course.
-
-AUTHOR
- Aran Clary Deltac <bluefeet@cpan.org>
-
-LICENSE
- You may distribute this code under the same terms as Perl itself.
-
use base qw( DBIx::Class );
-our $VERSION = '0.03000';
+our $VERSION = '0.03001';
1;
__END__
=head1 DESCRIPTION
-The tree modules provide the tools to represent, modify, and analyze
+The tree modules provide the tools to represent, modify, and analyze
trees of data with DBIx::Class.
=head1 COMPONENTS
-L<DBIx::Class::Tree::AdjacencyList> - Manage a tree of data using the
+L<DBIx::Class::Tree::AdjacencyList> - Manage a tree of data using the
common adjacency list model.
-L<DBIx::Class::Tree::AdjacencyList::Ordered> - Glue DBIx::Class::Ordered
+L<DBIx::Class::Tree::AdjacencyList::Ordered> - Glue DBIx::Class::Ordered
and DBIx::Class::Tree::AdjacencyList together.
=head1 DAG
-All tree related modules must conform to have and use the basic traversal
-methods of a DAG. For the most part this just means that Tree modules
-must provide the appearance of having multiple parents per node (via a
-parents() method) but may very well never return more than one parent.
-All utility modules, such as a Visitor module, should do its best to
-never assume that a node only has one parent. There are situations
-where this is not possible - in those cases the module's documentation
+All tree related modules must conform to have and use the basic traversal
+methods of a DAG. For the most part this just means that Tree modules
+must provide the appearance of having multiple parents per node (via a
+parents() method) but may very well never return more than one parent.
+All utility modules, such as a Visitor module, should do its best to
+never assume that a node only has one parent. There are situations
+where this is not possible - in those cases the module's documentation
should clearly state that it is not compatible with DAGs.
-So far there is no Tree::DAG module, but there will be. These requirements
-are vague, and the requirements of Tree modules to be DAG compatible will
+So far there is no Tree::DAG module, but there will be. These requirements
+are vague, and the requirements of Tree modules to be DAG compatible will
become more defined in due course.
=head1 AUTHOR