|
|
|
|
apply plugin: 'com.android.application'
|
|
|
|
|
|
|
|
|
|
android {
|
|
|
|
|
compileSdkVersion 28
|
|
|
|
|
|
|
|
|
|
defaultConfig {
|
|
|
|
|
applicationId "com.beemdevelopment.aegis"
|
|
|
|
|
minSdkVersion 19
|
|
|
|
|
targetSdkVersion 28
|
|
|
|
|
versionCode 18
|
|
|
|
|
versionName "1.0-beta1"
|
|
|
|
|
}
|
Introduce UUIDMap for storing objects that are keyed by a UUID
This patch introduces the new ``UUIDMap`` type, reducing code duplication and
making UUID lookups faster. We currently already use UUIDs as the identifier for
the ``DatabaseEntry`` and ``Slot`` types, but the way lookups by UUID work are
kind of ugly, as we simply iterate over the list until we find a match. As we're
probably going to have more types like this soon (groups and icons, for
example), I figured it'd be good to abstract this away into a separate type and
make it a map instead of a list.
The only thing that has gotten slower is the ``swap`` method. The internal
``LinkedHashMap`` retains insertion order with a linked list, but does not know
about the position of the values, so we basically have to copy the entire map to
simply swap two values. I don't think it's too big of a deal, because swap
operations still take less than a millisecond even with large vaults, but
suggestions for improving this are welcome.
I had to update gradle and JUnit to be able to use the new ``assertThrows``
assertion method, so this patch includes that as well.
6 years ago
|
|
|
|
|
|
|
|
lintOptions {
|
|
|
|
|
abortOnError true
|
|
|
|
|
disable "MissingTranslation"
|
|
|
|
|
}
|
|
|
|
|
|
Introduce UUIDMap for storing objects that are keyed by a UUID
This patch introduces the new ``UUIDMap`` type, reducing code duplication and
making UUID lookups faster. We currently already use UUIDs as the identifier for
the ``DatabaseEntry`` and ``Slot`` types, but the way lookups by UUID work are
kind of ugly, as we simply iterate over the list until we find a match. As we're
probably going to have more types like this soon (groups and icons, for
example), I figured it'd be good to abstract this away into a separate type and
make it a map instead of a list.
The only thing that has gotten slower is the ``swap`` method. The internal
``LinkedHashMap`` retains insertion order with a linked list, but does not know
about the position of the values, so we basically have to copy the entire map to
simply swap two values. I don't think it's too big of a deal, because swap
operations still take less than a millisecond even with large vaults, but
suggestions for improving this are welcome.
I had to update gradle and JUnit to be able to use the new ``assertThrows``
assertion method, so this patch includes that as well.
6 years ago
|
|
|
testOptions {
|
|
|
|
|
unitTests.all {
|
|
|
|
|
useJUnitPlatform()
|
|
|
|
|
|
|
|
|
|
ignoreFailures false
|
|
|
|
|
testLogging {
|
|
|
|
|
events "passed", "skipped", "failed", "standardOut", "standardError"
|
|
|
|
|
}
|
Introduce UUIDMap for storing objects that are keyed by a UUID
This patch introduces the new ``UUIDMap`` type, reducing code duplication and
making UUID lookups faster. We currently already use UUIDs as the identifier for
the ``DatabaseEntry`` and ``Slot`` types, but the way lookups by UUID work are
kind of ugly, as we simply iterate over the list until we find a match. As we're
probably going to have more types like this soon (groups and icons, for
example), I figured it'd be good to abstract this away into a separate type and
make it a map instead of a list.
The only thing that has gotten slower is the ``swap`` method. The internal
``LinkedHashMap`` retains insertion order with a linked list, but does not know
about the position of the values, so we basically have to copy the entire map to
simply swap two values. I don't think it's too big of a deal, because swap
operations still take less than a millisecond even with large vaults, but
suggestions for improving this are welcome.
I had to update gradle and JUnit to be able to use the new ``assertThrows``
assertion method, so this patch includes that as well.
6 years ago
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
buildTypes {
|
|
|
|
|
debug {
|
|
|
|
|
minifyEnabled false
|
|
|
|
|
applicationIdSuffix ".debug"
|
|
|
|
|
manifestPlaceholders = [title: "AegisDev", iconName: "ic_launcher_debug"]
|
|
|
|
|
resValue "bool", "pref_secure_screen_default", "false"
|
|
|
|
|
}
|
|
|
|
|
release {
|
|
|
|
|
minifyEnabled false
|
|
|
|
|
proguardFiles getDefaultProguardFile('proguard-android.txt'), 'proguard-rules.pro'
|
|
|
|
|
manifestPlaceholders = [title: "Aegis", iconName: "ic_launcher"]
|
|
|
|
|
resValue "bool", "pref_secure_screen_default", "true"
|
|
|
|
|
}
|
|
|
|
|
}
|
Introduce UUIDMap for storing objects that are keyed by a UUID
This patch introduces the new ``UUIDMap`` type, reducing code duplication and
making UUID lookups faster. We currently already use UUIDs as the identifier for
the ``DatabaseEntry`` and ``Slot`` types, but the way lookups by UUID work are
kind of ugly, as we simply iterate over the list until we find a match. As we're
probably going to have more types like this soon (groups and icons, for
example), I figured it'd be good to abstract this away into a separate type and
make it a map instead of a list.
The only thing that has gotten slower is the ``swap`` method. The internal
``LinkedHashMap`` retains insertion order with a linked list, but does not know
about the position of the values, so we basically have to copy the entire map to
simply swap two values. I don't think it's too big of a deal, because swap
operations still take less than a millisecond even with large vaults, but
suggestions for improving this are welcome.
I had to update gradle and JUnit to be able to use the new ``assertThrows``
assertion method, so this patch includes that as well.
6 years ago
|
|
|
|
|
|
|
|
compileOptions {
|
|
|
|
|
targetCompatibility 1.8
|
|
|
|
|
sourceCompatibility 1.8
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
dependencies {
|
|
|
|
|
def libsuVersion = '2.3.2'
|
|
|
|
|
implementation fileTree(dir: 'libs', include: ['*.jar'])
|
|
|
|
|
implementation 'com.amulyakhare:com.amulyakhare.textdrawable:1.0.1'
|
|
|
|
|
implementation 'androidx.appcompat:appcompat:1.0.2'
|
|
|
|
|
implementation 'androidx.cardview:cardview:1.0.0'
|
|
|
|
|
implementation 'androidx.preference:preference:1.0.0'
|
|
|
|
|
implementation 'com.takisoft.preferencex:preferencex:1.0.0'
|
|
|
|
|
implementation 'com.google.android.material:material:1.0.0'
|
|
|
|
|
implementation 'androidx.recyclerview:recyclerview:1.0.0'
|
|
|
|
|
implementation 'androidx.legacy:legacy-support-v4:1.0.0'
|
|
|
|
|
implementation 'com.getbase:floatingactionbutton:1.10.1'
|
|
|
|
|
implementation 'com.github.apl-devs:appintro:v4.2.2'
|
|
|
|
|
implementation 'com.github.avito-tech:krop:0.44'
|
|
|
|
|
implementation 'com.madgag.spongycastle:core:1.58.0.0'
|
|
|
|
|
implementation 'com.mattprecious.swirl:swirl:1.0.0'
|
|
|
|
|
implementation 'de.hdodenhof:circleimageview:2.2.0'
|
|
|
|
|
implementation 'me.dm7.barcodescanner:zxing:1.9'
|
|
|
|
|
implementation "com.github.topjohnwu.libsu:core:${libsuVersion}"
|
|
|
|
|
implementation "com.github.topjohnwu.libsu:io:${libsuVersion}"
|
|
|
|
|
implementation 'com.github.bumptech.glide:annotations:4.9.0'
|
|
|
|
|
implementation 'com.github.bumptech.glide:glide:4.9.0'
|
|
|
|
|
implementation ("com.github.bumptech.glide:recyclerview-integration:4.9.0") {
|
|
|
|
|
transitive = false
|
|
|
|
|
}
|
|
|
|
|
annotationProcessor 'androidx.annotation:annotation:1.1.0'
|
|
|
|
|
annotationProcessor 'com.github.bumptech.glide:compiler:4.9.0'
|
Introduce UUIDMap for storing objects that are keyed by a UUID
This patch introduces the new ``UUIDMap`` type, reducing code duplication and
making UUID lookups faster. We currently already use UUIDs as the identifier for
the ``DatabaseEntry`` and ``Slot`` types, but the way lookups by UUID work are
kind of ugly, as we simply iterate over the list until we find a match. As we're
probably going to have more types like this soon (groups and icons, for
example), I figured it'd be good to abstract this away into a separate type and
make it a map instead of a list.
The only thing that has gotten slower is the ``swap`` method. The internal
``LinkedHashMap`` retains insertion order with a linked list, but does not know
about the position of the values, so we basically have to copy the entire map to
simply swap two values. I don't think it's too big of a deal, because swap
operations still take less than a millisecond even with large vaults, but
suggestions for improving this are welcome.
I had to update gradle and JUnit to be able to use the new ``assertThrows``
assertion method, so this patch includes that as well.
6 years ago
|
|
|
testRuntimeOnly 'org.junit.jupiter:junit-jupiter-engine:5.4.2'
|
|
|
|
|
testImplementation 'org.junit.jupiter:junit-jupiter-api:5.4.2'
|
|
|
|
|
}
|
