Search Results for "java swing components library"
Sort By:
Showing 7 open source projects for "java swing components library"
View related business solutions-
Field Service+ for MS Dynamics 365 & SalesforceResco’s mobile solution streamlines your field service operations with offline work, fast data sync, and powerful tools for frontline workers, all natively integrated into Dynamics 365 and Salesforce.
-
The AI workplace management platformBy combining AI workflows, predictive intelligence, and automated insights, OfficeSpace gives leaders a complete view of how their spaces are used and how people work. Facilities, IT, HR, and Real Estate teams use OfficeSpace to optimize space utilization, enhance employee experience, and reduce portfolio costs with precision.
-
1
Application Inspector
A source code analyzer built for surfacing features of interest
Microsoft Application Inspector is a software source code characterization tool that helps identify coding features of first or third party software components based on well-known library/API calls and is helpful in security and non-security use cases. It uses hundreds of rules and regex patterns to surface interesting characteristics of source code to aid in determining what the software is or what it does from what file operations it uses, encryption, shell operations, cloud API's,... -
2
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). ... -
3
How good is your software? jmove eases the understanding and valuation of the design and architecture of complex software written in java. It provides dependency analysis, metrics, design rule checking and impact analysis.
-
4
BPUtils
Sterling Integrator BP utilities
BPUtils is a Sterling Integrator BP file manipulation program. It features : - XPath expressions control : BPUtils checks that the XPath expressions defined in the BP file are correct - Consistency control : Controls that the sequences and the on faults are named in a correct way - Auto layout formatting : Formats automatically your BP layouts ! - BP tree printing : BPUtils is able to print to the console standard output the BP tree - BP dependencies analysis : Get the list... -
Simplify Purchasing For Your BusinessSimplify every aspect of buying for your business in Order.co. From sourcing products to scaling purchasing across locations to automating your AP and approvals workstreams, Order.co is the platform of choice for growing businesses.
-
5
component-watch
Describe and watch component structure of java programs
"Component-Watch" is a tool discovering, showing and assessing the structure of (big) java programs from their classes. It finds what are the components composing a program, analyse what are the relations between those components and compare those the the permitted relations between components. The tool helps to easily define and display UML-like diagrams showing components and their relationship. -
6
JBVD
Java Bytecode Viewer & Decompiler
A very powerful java bytecode viewer and decompiler which makes use of the javassist open source library. -
7
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (<...
- Previous
- You're on page 1
- Next
