• Intro Headers Instructions Macros Commands
Fork me on GitHub
    • Getting Started
      • Introduction
      • How to install bnd
      • Guided Tour Workspace & Projects
      • bnd / bndlib Features and JAR Wrapping Techniques
      • FAQ - Frequently Asked Questions
    • Concepts and Practices
      • Concepts
      • Background
      • Best practices
    • Build and Development
      • Build
      • Generating JARs
      • Versioning
      • Baselining
      • Service Components
      • Metatype
      • Contracts
      • Bundle Annotations
      • Accessor Properties
      • SPI Annotations
    • Dependency and Launching
      • Resolving Dependencies
      • Launching
      • Startlevels
    • Testing
      • Testing
      • Testing with Launchpad
    • Packaging and Distribution
      • Packaging Applications
      • JPMS Libraries
      • Wrapping Libraries to OSGi Bundles
    • Documentation and Tools
      • Generating Documentation
      • bnd CLI Commands
      • For Developers
      • Templates for Workspaces
      • Tips for Windows users
      • Tools bound to bnd
    • Reference Material
      • Reference
      • Headers
      • Instruction Reference
      • Instruction Index
      • Macro Reference
      • Macro Index
      • Plugins
      • External Plugins
    • Configuration and Troubleshooting
      • Settings
      • Errors
      • Warnings
  • uniq (';' LIST )*

    Prev Next
    Macro
    Concatenate the lists and then remove any duplicates.

    Split all the given lists on their commas, combine them in one list and remove any duplicates. The ordering is not preserved, see [${sort}][#sort] For example:

    ${unique; 1,2,3,1,2; 1,2,4 } ~ “2,4,3,1”
    static String	_uniqHelp	= "${uniq;<list> ...}";
    
    public String _uniq(String args[]) {
    	verifyCommand(args, _uniqHelp, null, 1, Integer.MAX_VALUE);
    	Set<String> set = new LinkedHashSet<String>();
    	for (int i = 1; i < args.length; i++) {
    		Processor.split(args[i], set);
    	}
    	return Processor.join(set, ",");
    }
    
Prev Next
Search
    • Home