Skip to main content

AOP Method Signiture Pattern

AOP Method Signiture Patterns
I studied a lot of time to study AOP.
as i studied i feel like master of AOP but as time gone by i forget how to use
and re searching online guide of AOP
so I want summarize about use of AOP
Hope that it would be helpful me and you guys

The first wild card means method type : public, private, protected, *(all)

If AopTest.class exist in different package
execution(* com.sang.hwa.AopTest.*(..)) if AopTest.class exist in same package
all method mapping in AopTest.class
execution(* AopTest.*(..)) //If class name has xxxxController.class it will be mapped execution(public * com.sns.controller..*Controller.*(..)) package com.sns.common.aspect; import java.lang.annotation.Documented; import java.lang.annotation.ElementType; import java.lang.annotation.Retention; import java.lang.annotation.RetentionPolicy; import java.lang.annotation.Target; /** * {@link SnsPointDay} 의 point-cut 지정 및 결과 코드 처리를 위한 어노테이션 * */ @Target({ ElementType.METHOD, ElementType.TYPE }) @Retention(RetentionPolicy.RUNTIME) @Documented public @interface SnsPointDay { public String div() default "00"; public String category(); public String item(); public int point() default 1; public String status() default ""; } @Before(@annotation(com.sns.common.aspect.SnsPointDay)) @AfterReturning("@annotation(point)") public void afterControllerWithPoint(JoinPoint jp, SnsPoint point) throws Throwable { } //Annotation Expression //$$(And), ||(or), !(not) @Pointcut("operation() || execution() || @annotation(pointDay)") @Before("execution(* *.*(..)) && target(target) && args(a,b)") public void logParameter(Object target, dobule a, double b){"class : " + taget.getClass().getName());" values : " + a + " , " + b); }


Popular posts from this blog

codefights smooth sailing ( CommonCharacterCount) s1, String s2) { int sum = 0; char[] as= s1.toCharArray(); char[] bs= s2.toCharArray(); int[] ias = newint[126]; int[] ibs = newint[126]; for (int i = 0; i < as.length; i++) { ias[(int)as[i]]++; } for (int i = 0; i < bs.length; i++) { ibs[(int)bs[i]]++; } for (int i = 0; i < ibs.length; i++) { sum += Math.min(ias[i], ibs[i]); } return sum; }

Given two strings, find the number of common characters between them. Example For s1 = "aabcc" and s2 = "adcaa", the output should be
commonCharacterCount(s1, s2) = 3. Strings have 3 common characters - 2 "a"s and 1 "c". Input/Output [time limit] 3000ms (java)[input] string s1 A string consisting of lowercase latin letters a-z. Guaranteed constraints:
1 ≤ s1.length ≤ 15. [input] string s2 A string consisting of lowercase latin letters a-z. Guaranteed constr…

Bucket Sort in python

I make buckets as many as size of arr
and put data.

arr = [0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434] def bucketSort(arr, size): buckets = [[] for i in range(size)] # put arr in bucket for i in range(len(arr)): num = size*arr[i] buckets[int(num)].append(arr[i]) output = [] # use insertion sort for i in range(len(buckets)): insertionSort(buckets[i]) # concat all data for i in range(len(buckets)): while len(buckets[i]) > 0: output.append(buckets[i].pop(0)) return output def swap(arr, i, j): temp = arr[i] arr[i] = arr[j] arr[j] = temp def insertionSort(arr): for i in range(1, len(arr)): index= i print("index : " + str(i)) while index!=0: if arr[index] < arr[index-1]: temp = arr[index] arr[index]= arr[index-1] arr[index-1] = temp index = index-1print(arr) else …