java.util.Collections 集合帮助类 示例程序(JUnit演示) 排序 @Test public void testSort() { ListInteger demoList = new ArrayListInteger(Arrays.asList(3, 2, 1)); assertEquals(3, demoList.get(0).intValue()); //public static T extends Comparable
java.util.Collections 集合帮助类
示例程序(JUnit演示)
排序
<code class="java"> @Test public void testSort() { List<Integer> demoList = new ArrayList<Integer>(Arrays.asList(3, 2, 1)); assertEquals(3, demoList.get(0).intValue()); //public static <T extends Comparable<? super T>> void sort(List<T> list) Collections.sort(demoList); assertEquals(1, demoList.get(0).intValue()); //public static void shuffle(List<?> list) // 随机排序 //public static void reverse(List<?> list) // 反序 }
查找
<code class="java"> @Test public void testBinarySearch() { List<Integer> demoList = new ArrayList<Integer>(Arrays.asList(3, 2, 1)); //必须先排序 Collections.sort(demoList); assertEquals(1, demoList.get(0).intValue()); //二分查找位置 //public static <T> int binarySearch(List<? extends Comparable<? super T>> list, T key) assertEquals(0, Collections.binarySearch(demoList, 1)); //public static int indexOfSubList(List<?> source, List<?> target) // public static int lastIndexOfSubList(List<?> source, List<?> target) }
置换
<code class="java "> @Test public void testSwap() { List<Integer> demoList = new ArrayList<Integer>(Arrays.asList(3, 2, 1)); //public static void swap(List<?> list, int i, int j) Collections.swap(demoList, 0, 2); assertEquals(1, demoList.get(0).intValue()); //public static void rotate(List<?> list, int distance) //指定距离轮换 //public static <T> boolean replaceAll(List<T> list, T oldVal, T newVal) //指定替换 }
拷贝
<code class="java "> @Test public void testCopy() { List<Integer> demoList = new ArrayList<Integer>(Arrays.asList(3, 2, 1)); //public static <T> void copy(List<? super T> dest, List<? extends T> src) //注意目的List的size最少要等于src的size List<Integer> copyList = new ArrayList<Integer>(Arrays.asList(1, 2, 3)); Collections.copy(copyList, demoList); assertEquals(3, copyList.size()); assertEquals(3, copyList.get(0).intValue()); copyList.add(4); assertEquals(3, demoList.size()); }
比较
<code class="java "> @Test public void testCompary() { List<Integer> demoList = new ArrayList<Integer>(Arrays.asList(3, 2, 1)); assertEquals(1, Collections.min(demoList).intValue()); assertEquals(3, Collections.max(demoList).intValue()); List<Integer> compareList = new ArrayList<Integer>(Arrays.asList(5, 6, 7)); //Returns true if the two specified collections have no elements in common assertTrue(Collections.disjoint(demoList, compareList)); }
创造不同的集合
<code class="java "> @SuppressWarnings("unused") @Test public void testCreate() { List<Integer> demoList = new ArrayList<Integer>(Arrays.asList(3, 2, 1)); //空对象 size=0 无添加方法 List<Integer> emptyList = Collections.emptyList(); //返回一个只包含指定对象的不可变列表。 List<Integer> singletonList = Collections.singletonList(1); //返回指定列表的一个动态类型安全视图。 List<Integer> checkedList = Collections.checkedList(demoList, Integer.class); //返回指定列表的不可修改视图。 List<Integer> unmodifiableList = Collections.unmodifiableList(demoList); //返回指定列表支持的同步(线程安全的)列表。 List<Integer> synchronizedList = Collections.synchronizedList(demoList); synchronized (synchronizedList) { Iterator<Integer> i = synchronizedList.iterator(); // Must be in synchronized block while (i.hasNext()) i.next(); } //map set sortedMap sortedSet }
环境 jdk1.6 window7 junit4

Stored procedures are precompiled SQL statements in MySQL for improving performance and simplifying complex operations. 1. Improve performance: After the first compilation, subsequent calls do not need to be recompiled. 2. Improve security: Restrict data table access through permission control. 3. Simplify complex operations: combine multiple SQL statements to simplify application layer logic.

The working principle of MySQL query cache is to store the results of SELECT query, and when the same query is executed again, the cached results are directly returned. 1) Query cache improves database reading performance and finds cached results through hash values. 2) Simple configuration, set query_cache_type and query_cache_size in MySQL configuration file. 3) Use the SQL_NO_CACHE keyword to disable the cache of specific queries. 4) In high-frequency update environments, query cache may cause performance bottlenecks and needs to be optimized for use through monitoring and adjustment of parameters.

The reasons why MySQL is widely used in various projects include: 1. High performance and scalability, supporting multiple storage engines; 2. Easy to use and maintain, simple configuration and rich tools; 3. Rich ecosystem, attracting a large number of community and third-party tool support; 4. Cross-platform support, suitable for multiple operating systems.

The steps for upgrading MySQL database include: 1. Backup the database, 2. Stop the current MySQL service, 3. Install the new version of MySQL, 4. Start the new version of MySQL service, 5. Recover the database. Compatibility issues are required during the upgrade process, and advanced tools such as PerconaToolkit can be used for testing and optimization.

MySQL backup policies include logical backup, physical backup, incremental backup, replication-based backup, and cloud backup. 1. Logical backup uses mysqldump to export database structure and data, which is suitable for small databases and version migrations. 2. Physical backups are fast and comprehensive by copying data files, but require database consistency. 3. Incremental backup uses binary logging to record changes, which is suitable for large databases. 4. Replication-based backup reduces the impact on the production system by backing up from the server. 5. Cloud backups such as AmazonRDS provide automation solutions, but costs and control need to be considered. When selecting a policy, database size, downtime tolerance, recovery time, and recovery point goals should be considered.

MySQLclusteringenhancesdatabaserobustnessandscalabilitybydistributingdataacrossmultiplenodes.ItusestheNDBenginefordatareplicationandfaulttolerance,ensuringhighavailability.Setupinvolvesconfiguringmanagement,data,andSQLnodes,withcarefulmonitoringandpe

Optimizing database schema design in MySQL can improve performance through the following steps: 1. Index optimization: Create indexes on common query columns, balancing the overhead of query and inserting updates. 2. Table structure optimization: Reduce data redundancy through normalization or anti-normalization and improve access efficiency. 3. Data type selection: Use appropriate data types, such as INT instead of VARCHAR, to reduce storage space. 4. Partitioning and sub-table: For large data volumes, use partitioning and sub-table to disperse data to improve query and maintenance efficiency.

TooptimizeMySQLperformance,followthesesteps:1)Implementproperindexingtospeedupqueries,2)UseEXPLAINtoanalyzeandoptimizequeryperformance,3)Adjustserverconfigurationsettingslikeinnodb_buffer_pool_sizeandmax_connections,4)Usepartitioningforlargetablestoi


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

EditPlus Chinese cracked version
Small size, syntax highlighting, does not support code prompt function

Safe Exam Browser
Safe Exam Browser is a secure browser environment for taking online exams securely. This software turns any computer into a secure workstation. It controls access to any utility and prevents students from using unauthorized resources.

SublimeText3 Mac version
God-level code editing software (SublimeText3)

SublimeText3 Linux new version
SublimeText3 Linux latest version

VSCode Windows 64-bit Download
A free and powerful IDE editor launched by Microsoft
