Search Results for "common"

...The repository defines patterns and reusable components for validating agent decisions, sanitizing user inputs, and enforcing operational boundaries, making it easier to design fail-safe integrations with both internal toolchains and external APIs. It includes example safety checks that cover common categories like infinite loops, unsafe system commands, data leakage risks, and visibility constraints, which help engineering teams anticipate and defend against unpredictable agent behavior.

The Filesystem component provides platform-independent utilities for filesystem operations and for file/directory paths manipulation. The component contains two main classes called Filesystem and Path. mkdir() creates a directory recursively. On POSIX filesystems, directories are created with a default mode value 0777. You can use the second argument to set your own mode. exists() checks for the presence of one or more files or directories and returns false if any of them is missing. copy()...

XPath expressions are incredibly flexible, so there is almost always an XPath expression that will find the element you need. Unfortunately, they can also become very complicated, and the learning curve is steep. Even common operations (such as finding an element with a particular class) can require long and unwieldy expressions. CSS selectors are less powerful than XPath, but far easier to write, read and understand. Since they are less powerful, almost all CSS selectors can be converted to an XPath equivalent. This XPath expression can then be used with other functions and classes that use XPath to find elements in a document. ...

Full Docs: Download: JeevaX.Y.html Compare folder contents: jeeva --overlap/--mtime/--diff folder1 folder2 --overlap (see files that are in one or other folder, or common to both.) --mtime (files that are newer, the same age, or older ) --diff (files whose content is identical or different) Optionally can recursively descend to a specified depth or completely down folder tree comparing corresponding folders while descending. --copy for mirroring folders, primarily for keeping mirror on another drive or frequent copying to USB stick. ...

Java Batch Job Framework. The JBJF uses an XML definition file to abstract many of your common batch job parameters. The JBJF programming framework uses a task list concept as a divide and conquer strategy to simplify your batch job development.

The Sleuth Kit is a C++ library and collection of open source file system forensics tools that allow you to, among other things, view allocated and deleted data from NTFS, FAT, FFS, EXT2, Ext3, HFS+, and ISO9660 images.

This is a modern set of libraries intended for use in software related to the Tandy Radio Shack Color Computer (the CoCo). Some functionality may also be useful in more general Motorola 6809 centered projects. CocoCommons provides a set of libraries for common tasks such as reading DECB and RBF filesystems, interpretting common file formats, and displaying CoCo-like screens. These are used extensively in the DriveWire 4 project and the upcoming nineserver project. In time it these libraries should implement most of the functionality now found in the Toolshed project.

Common Lisp User Space File System.

The Common Scripting Interface is a pseudofs which provides simple data via Read Write calls much the same as procfs. The goal is to drop the overhead of scripts and up efficiency by removing the need for multiple instances of the same library in RAM

Java Virtual System (JVS) is built around a virtual file system (VFS) - a common platform of Java, by Java, for Java. JVS extends JVM and makes it from an interpreter running half-compiled code a first-class server.

TriOS - The Object Oriented Operating System, is the next generation operating system. Fully based on object orientation, it brings unique features to programmers and end users. Basically everything in TriOS is an object, even files and programs! Enjoy!!

ZZ is an open-source WinFS. ZZ relies on the same fundamental idea as WinFS, namely that a graph-oriented data store is more user-friendly than the usual tree model.