FIND YOUR NEXT FEW LINES

Results for “File operations & paths”

Small, practical examples. Search by task or narrow things down below.

946 snippets foundClear filters
SQLiteBulk changes & set operations

Find rows in the first result but not the second

SQLite: EXCEPT calculates a distinct result-set difference.

SQLite✓ Tested
SQLBulk changes & set operations

Find rows shared by two query results

SQL: INTERSECT compares complete selected rows and removes duplicates.

SQL✓ Tested
SQL ServerBulk changes & set operations

Find rows shared by two query results

SQL Server: INTERSECT compares complete selected rows and removes duplicates.

SQL Server✓ Tested
PostgresBulk changes & set operations

Find rows shared by two query results

Postgres: INTERSECT compares complete selected rows and removes duplicates.

Postgres✓ Tested
SQLiteBulk changes & set operations

Find rows shared by two query results

SQLite: INTERSECT compares complete selected rows and removes duplicates.

SQLite✓ Tested
JavaQueues & collection operations

Find set members missing from another set

Java: Use removeAll on a copy to calculate a set difference.

Java✓ Tested
JavaQueues & collection operations

Find shared set members

Java: Copy a set before retainAll when the original must remain unchanged.

Java✓ Tested
C++Ordering & set operations

Find sorted set members missing from another set

C++: set_difference writes elements present in the first sorted input but absent from the second.

C++✓ Tested
C++Ordering & set operations

Find the common members of two sorted sets

C++: set_intersection requires both input ranges to be sorted under the same comparator.

C++✓ Tested
JavaScriptUTC date operations

Find the final day of a month

JavaScript: Day zero of the following UTC month selects the previous month’s final day.

JavaScript✓ Tested
TypeScriptUTC date operations

Find the final day of a month

TypeScript: Day zero of the following UTC month selects the previous month’s final day.

TypeScript✓ Tested
C++Ordering & set operations

Find the insertion position for a sorted value

C++: lower_bound returns the first position whose value is not less than the search key.

C++✓ Tested