Extension:DynamicPageList3

The DynamicPageList3 extension is a reporting tool for MediaWiki, listing category members and intersections with various formats and details. For full documentation, see the [https://help.gamepedia.com/Extension:DPL3/Manual manual].

When invoked with a basic set of selection parameters, DPL displays a list of pages in one or more categories. Selections may also be based on factors such as author, namespace, date, name pattern, usage of templates, or references to other articles. Output takes a variety of forms, some of which incorporate elements of selected articles.

This extension is invoked with the parser function   or parser tag . A 1>Special:MyLanguage/Extension:DynamicPageList (Wikimedia)|Wikimedia-compatible implementation of certain features can be invoked with .

Complex look ups can result in computationally expensive database queries. However, by default all output is cached for a period of one hour to reduce the need to rerun the query every page load. The [https://help.gamepedia.com/Extension:DPL3/Parameters:_Other_parameters#cacheperiod DPL:Parameters: Other Parameters] manual page contains information on parameters that can be used to disable the cache and allow instant updates.


 * Manual and Complete Documentation: [https://help.gamepedia.com/Extension:DPL3/Manual Documentation at Gamepedia Help Wiki]
 * Source Code:
 * Bugs and Feature Requests:
 * Licensing: DynamicPageList3 is released under [https://opensource.org/licenses/GPL-2.0</> GNU General Public License, version 2].

Configuration
These are DPL's configuration settings along with their default values. To change them make sure they are defined before including the extension on the wiki.

The global variable is automatically respected by DPL. It will prevent the contents of the listed namespaces from appearing in DPL's output.

Functional Richness
DynamicPageList has many features which are unlocked based on the maximum functional richness level. There are some that can cause high CPU or database load and should be used sparingly.


 * is equivalent to Wikimedia's DynamicPageList
 * adds additional formatting parameters
 * adds performance equivalent features for templates and pagelinks
 * allows more-expensive page inclusion features and regular expression queries.
 * permits exotic and potentially dangerous batch update and delete operations; not recommended for public websites. Includes debugging parameters for testing and development.

Extended DPL Functionality
Extended DPL is invoked by using the parser function, or the parser extension tag <DPL ></DPL>.


 * See: Manual - General Usage and Invocation Syntax and DPL:Parameters: Criteria for Page Selection

Backwards Compatibility
Functionality compatible with Wikimedia's DPL extension can be invoked with <DynamicPageList ></DynamicPageList>. Further information can be found on the Compatibility manual page.

Usage Philosophy and Overview
With the assumption there are some articles written about countries those articles will typically have three things in common:
 * They will belong to a common category
 * They will have a similar chapter structure, i.e. they will contain paragraphs named 'Religion' or 'History'
 * They will use a template which is used to present highly structured short data items ('Capital', 'Inhabitants', ..) in a nice way (e.g. as a wikitable)

Generate a Report Based on countries
If there was a need to assemble a report of what countries practice a certain religion this could be easily done with the category and linksto parameters.

With DPL one could:
 * Generate a list of all those articles (or a random sample)
 * Show metadata of the articles (popularity, date of last update, ..)
 * Show one or more chapters of the articles ('transclude' content)
 * Show parameter values which are passed to the common template
 * Order articles appropriately
 * Present the result in a sortable table (e.g.)
 * Generate multiple column output

Which steps are necessary?
Find the articles you want to list:
 * Select by a logical combination (AND,OR,NOT) of categories
 * Specify a range for the number of categories the article must be assigned to
 * Select by a logical combination (AND,OR,NOT) of namespaces
 * Define a pattern which must match the article's name
 * Name a page to which the article must or must not link
 * Name a template which the article must or must not use
 * Name a text pattern which must occur within external links from a page
 * Exclude or include redirections
 * Restrict your search to stable pages or quality pages ("flagged revisions")
 * Use other criteria for selection like author, date of last change etc.
 * Define regular expressions to match the contents of pages you want to include

Order the result list of articles according to
 * Article Name
 * Article Size
 * Date of last change
 * Last User to Make an Edit

Define attributes you want to see
 * Article Name
 * Article Namespace
 * Article Size
 * Date of Last Change
 * Date of Last Access
 * Last User to Make an Edit

Define contents you want to show
 * Whole Article
 * Contents of Certain Sections (Identified by headings)
 * Text Portions (Defined by special marker tags in the article)
 * Values of template calls
 * Use a custom template to show output

Define the output format
 * Specify header and footer for the default output
 * Use ordered list, unordered list
 * Use tables
 * Format table fields individually by applying templates to their content
 * Use category style listing
 * Truncate title or contents to a certain maximum length
 * Add a link to the article or to one or more of its sections

Performance
DPL's code execution and database access is typically fast for typical category and article look ups. However, using loose LIKE and REGEXP match parameters and/or requesting large data sets can result in long database access times. Parser time should also be kept in consideration. For example, having the query of image results go into a template that displays them will result in a parser media transform for each one. This can quickly eat up 2MBs of RAM per media transform.