How to test SharedPreferences in Android?

Testing SharedPreferences in Android can be accomplished using Espresso and JUnit. SharedPreferences is a key-value storage mechanism in Android used to store small amounts of data. This guide demonstrates how to write unit tests for SharedPreferences.

Example of Testing SharedPreferences

import android.content.Context; import android.content.SharedPreferences; import androidx.preference.PreferenceManager; import org.junit.After; import org.junit.Before; import org.junit.Test; import static org.junit.Assert.assertEquals; public class SharedPreferencesTest { private SharedPreferences sharedPreferences; private SharedPreferences.Editor editor; private Context context; @Before public void setUp() { context = InstrumentationRegistry.getInstrumentation().getTargetContext(); sharedPreferences = PreferenceManager.getDefaultSharedPreferences(context); editor = sharedPreferences.edit(); } @After public void tearDown() { editor.clear(); editor.apply(); } @Test public void testSharedPreferences_SaveAndRetrieve() { // Save data to SharedPreferences String testKey = "test_key"; String testValue = "test_value"; editor.putString(testKey, testValue); editor.apply(); // Retrieve data from SharedPreferences String retrievedValue = sharedPreferences.getString(testKey, null); // Assert that the value is the same as what was saved assertEquals(testValue, retrievedValue); } }

SharedPreferences testing Android unit tests SharedPreferences example Android testing guide Espresso testing

Related Questions

How do I avoid rehashing overhead with std::set in multithreaded code?

How do I find elements with custom comparators with std::set for embedded targets?

How do I erase elements while iterating with std::set for embedded targets?

How do I provide stable iteration order with std::unordered_map for large datasets?

How do I reserve capacity ahead of time with std::unordered_map for large datasets?

How do I erase elements while iterating with std::unordered_map in multithreaded code?

How do I provide stable iteration order with std::map for embedded targets?

How do I provide stable iteration order with std::map in multithreaded code?

How do I avoid rehashing overhead with std::map in performance-sensitive code?

How do I merge two containers efficiently with std::map for embedded targets?