This Java program is to Implement SimpleBindings API.A simple implementation of Bindings backed by a HashMap or some other specified Map.
Here is the source code of the Java program to Implement SimpleBindings API. The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.Collection; import java.util.HashMap; import java.util.Iterator; import java.util.Map; import java.util.Set; import java.util.Map.Entry; import javax.script.SimpleBindings; public class SimpleBindingsImpl { private SimpleBindings simpleBindings; /** Default constructor uses a HashMap. **/ public SimpleBindingsImpl() { simpleBindings = new SimpleBindings(); } /** Constructor uses an existing Map to store the values. **/ public SimpleBindingsImpl(Map<String, Object> m) { simpleBindings = new SimpleBindings(m); } /** Removes all of the mappings from this map. **/ public void clear() { simpleBindings.clear(); } /** Returns true if this map contains a mapping for the specified key. **/ public boolean containsKey(Object key) { return simpleBindings.containsKey(key); } /** Returns true if this map maps one or more keys to the specified value. **/ public boolean containsValue(Object value) { return simpleBindings.containsValue(value); } /** Returns a Set view of the mappings contained in this map. **/ public Set<Map.Entry<String, Object>> entrySet() { return simpleBindings.entrySet(); } /** * Returns the value to which the specified key is mapped, or null if this * map contains no mapping for the key. **/ public Object get(Object key) { return simpleBindings.get(key); } /** Returns true if this map contains no key-value mappings. **/ public boolean isEmpty() { return simpleBindings.isEmpty(); } /** Returns a Set view of the keys contained in this map. **/ public Set<String> keySet() { return simpleBindings.keySet(); } /** Associates the specified value with the specified key in this map. **/ public Object put(String key, Object value) { return simpleBindings.put(key, value); } /** Copies all of the mappings from the specified map to this map. **/ public void putAll(Map<? extends String, ? extends Object> m) { simpleBindings.putAll(m); } /** Removes the mapping for the specified key from this map if present. **/ public Object remove(Object key) { return simpleBindings.remove(key); } /** Returns the number of key-value mappings in this map. **/ public int size() { return simpleBindings.size(); } /** Returns a Collection view of the values contained in this map. **/ public Collection<Object> values() { return simpleBindings.values(); } public static void main(String... arg) { SimpleBindingsImpl simpleBindings = new SimpleBindingsImpl(); simpleBindings.put("one", 100); simpleBindings.put("two", 200); simpleBindings.put("three", 300); Map<String, Object> anotherMap = new HashMap<String, Object>(); anotherMap.put("four", 400); anotherMap.put("five", 500); simpleBindings.putAll(anotherMap); System.out.println("the key set of the simpleBindings is "); Set<String> keySet = simpleBindings.keySet(); Iterator<String> itr = keySet.iterator(); while (itr.hasNext()) { System.out.print(itr.next() + "\t"); } System.out.println(); System.out.println("the values of the simpleBindings is "); Collection<Object> collectionValues = simpleBindings.values(); Iterator<Object> citr = collectionValues.iterator(); while (citr.hasNext()) { System.out.print(citr.next() + "\t"); } System.out.println(); System.out.println("the entry set of the simpleBindings is "); Iterator<Entry<String, Object>> eitr; Set<Entry<String, Object>> entrySet = simpleBindings.entrySet(); eitr = entrySet.iterator(); while (eitr.hasNext()) { System.out.println(eitr.next() + "\t"); } System.out.println("the simpleBindings contains Key \"three\" :" + simpleBindings.containsKey("three")); System.out.println("the simpleBindings contains Value 600 :" + simpleBindings.containsValue(600)); System.out.println("the size of the simpleBindings is " + simpleBindings.size()); simpleBindings.clear(); if (simpleBindings.isEmpty()) System.out.println("the simpleBindings is empty"); else System.out.println("the simpleBindings is not empty"); } }
$ javac SimpleBindingsImpl.java $ java SimpleBindingsImpl the key set of the simpleBindings is two five one three four the values of the simpleBindings is 200 500 100 300 400 the entry set of the simpleBindings is two=200 five=500 one=100 three=300 four=400 the simpleBindings contains Key "three" :true the simpleBindings contains Value 600 :false the size of the simpleBindings is 5 the simpleBindings is empty
Related posts:
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Hướng dẫn Java Design Pattern – Dependency Injection
Java Program to Implement Find all Back Edges in a Graph
Java Program to Implement Sorted Doubly Linked List
Java Program to Implement Control Table
Giới thiệu Google Guice – Dependency injection (DI) framework
Đồng bộ hóa các luồng trong Java
The Order of Tests in JUnit
Java Program to Generate a Random Subset by Coin Flipping
Request a Delivery / Read Receipt in Javamail
Date Time trong Java 8
Java Program to implement Circular Buffer
Guava CharMatcher
Java Switch Statement
Giới thiệu SOAP UI và thực hiện test Web Service
Java Program to Implement HashMap API
Phương thức tham chiếu trong Java 8 – Method References
How to Replace Many if Statements in Java
Java Program to Implement Queue
Check If Two Lists are Equal in Java
Java Program to Check Multiplicability of Two Matrices
Java Program to Implement Quick Sort Using Randomization
Java Program to Generate a Random UnDirected Graph for a Given Number of Edges
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm
Hướng dẫn sử dụng Java Reflection
LIKE Queries in Spring JPA Repositories
Java Program to Find a Good Feedback Edge Set in a Graph
Apache Commons Collections SetUtils
Java Program to find the maximum subarray sum using Binary Search approach
Spring Data JPA Delete and Relationships
Java Program to Compute DFT Coefficients Directly
Setting Up Swagger 2 with a Spring REST API