[译]Android注解--@hide

原文链接:http://stackoverflow.com/questions/17035271/what-does-hide-mean-in-the-android-source-code

@hide

当对包,类,方法和域使用时,@hide从文档中删除相关节点和所有子节点。

Android有两种不能通过SDK访问的API。
第一种是在com.android.internal包中的类。 第二种API类型是标记有@hide javadoc属性的类和方法的集合。

隐藏方法仍可以通过反射访问。@hide属性只是javadoc的一部分(droiddoc也是),所以@hide只是简单将方法/类/字段从API文档中排除。

例如,ActivityManager.java中的checkUidPermission标记为@hide:

/** @hide */
public static int checkUidPermission(String permission, int uid) {
    try {
        return AppGlobals.getPackageManager()
                .checkUidPermission(permission, uid);
    } catch (RemoteException e) {
        // Should never happen, but if it does... deny!
        Slog.e(TAG, "PackageManager is dead?!?", e);
    }
    return PackageManager.PERMISSION_DENIED;
}

不过,我们可以使用反射调用它。

Class c;
c = Class.forName("android.app.ActivityManager");
Method m = c.getMethod("checkUidPermission", new Class[] {String.class, int.class});
Object o = m.invoke(null, new Object[]{"android.permission.READ_CONTACTS", 10010});
展开阅读全文

hide handkerchief

06-07

Problem DescriptionnThe Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.nNow I introduce the game to you. Suppose there are N people played the game ,who sit on the ground forming a circle ,everyone owns a box behind them .Also there is a beautiful handkerchief hid in a box which is one of the boxes .nThen Haha(a friend of mine) is called to find the handkerchief. But he has a strange habit. Each time he will search the next box which is separated by M-1 boxes from the current box. For example, there are three boxes named A,B,C, and now Haha is at place of A. now he decide the M if equal to 2, so he will search A first, then he will search the C box, for C is separated by 2-1 = 1 box B from the current box A . Then he will search the box B ,then he will search the box A.nSo after three times he establishes that he can find the beautiful handkerchief. Now I will give you N and M, can you tell me that Haha is able to find the handkerchief or not. If he can, you should tell me "YES", else tell me "POOR Haha".n nnInputnThere will be several test cases; each case input contains two integers N and M, which satisfy the relationship: 1<=M<=100000000 and 3<=N<=100000000. When N=-1 and M=-1 means the end of input case, and you should not process the data.n nnOutputnFor each input case, you should only the result that Haha can find the handkerchief or not.n nnSample Inputn3 2n-1 -1n nnSample OutputnYESn 问答

没有更多推荐了,返回首页