Path Blacklist 6.x-1.1
File ID: 96908
Path Blacklist 6.x-1.1 Description
Description: Path blacklist is a modest module with a very specific aim. Suppose you have paths in your domain that are handled further upstream (by Apache, IIS, etc.) and not by drupal, e.g., http://example.com/staff or http://example.com/intranet. You obviously dond-deOaot want your web editor mistakenly using these paths and, thus, creating nodes that will never be viewed.
Path blacklist solves this problem. Create a list of unavailable paths (and/or patterns) in the admin section (UI borrowed from the block module) and your author/editord-deOaos hands are tied; he/she is prevented from creating a node with that path.
Initially sponsored by Education Development Center.
Related: paths, Blacklist, Creating, Module, Patterns, Admin, Section, andor, Create, borrowed, Problem, unavailable, authoreditor, sponsored, Education, Development, center, pathinitially, prevented, solves
O/S:BSD, Linux, Solaris, Mac OS X
File Size: 10.0 KB
|More Similar Code|
After wondering what the easiest what to access one object from another was, the following functions were written to automatically discover the shortest path possible. The find function takes the item to find and the object to find it from and tries finding out the best access path. The optional arguments control the search depth, memory usage, et cetera. The nth function is a helper function for accessing data containers that cannot be...
Provides a _paths_from_path_patterns that will generate a list of paths from a list of path patterns. A "path pattern" can include glob chars. By default it generates a recursive listing of file paths, but: recursion can be turned off,...
Simple program to print the full name of all occurrences of the given filename in your PATH. Kind of like the Unix "which" utility, but works for DLLs and other files as well.
Usage: findinpath.py filename
This function is based on Yen's k-Shortest Path algorithm (1971)
1) [shortestPaths]: the list of K shortest paths (in cell array 1xK)
2) [totalCosts] : costs of the K shortest paths (in array 1xK)
find the shortest Euclidean path that is bounded
by the functions low(t) and high(t).
the algorithm is based on Dijkstra shortest path search algorithm
[ty y] = shortest_path_mfile(t,low,high)
Shortlinks By Path hooks into the WordPress filter get_shortlink to only return the path for a shortlink. This makes it easier to retrieve the shortlink url with an absolute path minus the domain name.
By default WordPress returns the...
Provides a term blacklist for freetagging vocabulary.
Legacy Path is intended to support websites that are moving to Drupal but have content that either won't be managed by Drupal immediately or at all, but must remain reachable through it's original URL. The assumption is made that the legacy system...
Feed Path Publisher allows site admins to publish multiple RSS feeds in the document's <head> tag. Modern browsers use this information to populate the (usually orange) RSS icon in their URL or location bar.
Feeds can be published...
Fixes the problem of bad email 'Return-Path' header settings which prevent email bounce backs going to the sender
of the email.
Most mail servers appear to over-write any 'Return-path' headers sent by the PHP...
|User Review for Path Blacklist