CGLIB Common causes of this problem include using a final class or a non-visible class;
類似以下的spring錯誤資訊:
org.springframework.aop.framework.AopConfigException: Could not generate CGLIB subclass of class [class $Proxy145]: Common causes of this problem include using a final class or a non-visible class; nested exception is java.lang.IllegalArgumentException: Cannot subclass final class class $Proxy145
解決問題的檢查點:
1、需要AOP攔截的類是否是final的,final類不可使用CGLIB來代理。
2、是否在給BEAN配AOP的時候強制使用CGLIB,如果是則可指定proxyTargetClass屬性以讓spring強制代理目標類。
3、類是否被多次代理了,如果類被多次代理過,則第二次進行代理的時候拿到的是第一次代理後的物件,這個物件是個final形式的,所以會出現這個錯誤。
基於第三點要注意,類是否被多次程式碼不緊緊取決於類是否被配置了多次AOP,如果類實現了某個介面,則還要看類實現的介面是否被aop攔截過。如果類實現了介面且介面也被AOP攔截了,則很可能出現上面的錯誤(是否出錯取決於AOP代理執行的順序)。
相關推薦
CGLIB Common causes of this problem include using a final class or a non-visible class;
類似以下的spring錯誤資訊: org.springframework.aop.framework.AopConfigException: Could not generate CGLIB subclass of class [class $Proxy145]: Common causes o
Cannot access a disposed object. A common cause of this error is disposing
cat rap error app hat his pos solved you 異常信息: An unhandled exception was thrown by the application.System.ObjectDisposedException: Cann
An owner of this repository has limited the ability to open a pull request to users that are collaborators on this repository.
git 無法發起:pull request,提示:An owner of this repository has limited the ability to open a pull request to users that are collaborators on this repositor
pyspark 用fit訓練資料集的時候出現"Params must be either a param map or a list/tuple of param maps, "
在anaconda用決策樹訓練資料, from pyspark.ml.classification import DecisionTreeClassifier dt=DecisionTreeClassifier(labelCol="label",features
[LeetCode&Python] Problem 235. Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedi
Lowest Common Ancestor of a Binary Search Tree & a Binary Tree
max 結果 solution 返回 分析 else 當前 n) 如果 235. Lowest Common Ancestor of a Binary Search Tree 題目鏈接:https://leetcode.com/problems/lowest-common-
Lowest Common Ancestor of a Binary Search Tree
tor cnblogs span || ces while 宋體 tco earch 3 / 5 1 / \ / 6 2 0 8 /
LeetCode235:Lowest Common Ancestor of a Binary Search Tree
itself 一個 post 特性 || arc order amp ear Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in t
LeetCode_Lowest Common Ancestor of a Binary Search Tree (Binary Tree)
java text track ron 代碼 eno turn javascrip pan Lowest Common Ancestor of a Binary Search Tree 一、題目描寫敘述 二、思路及代碼 二叉搜索樹有個性
leetcode——Lowest Common Ancestor of a Binary Tree
sdn 右值 split arc candidate tex 查找樹 也好 左右 題目 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in t
236. Lowest Common Ancestor of a Binary Tree
roo nts its turn hal wikipedia nod truct blank Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
This problem will occur when running in 64 bit mode with the 32 bit Oracle client components installed.
safe bit min bad exc oci tex 應用 exceptio Attempt to load Oracle client libraries threw BadImageFormatException. This problem will occur w
Django URLs error: view must be a callable or a list/tuple in the case of include()
mean see ews patch port code eve con pattern Django 1.10 no longer allows you to specify views as a string (e.g. ‘myapp.views.home‘) in y
Leetcode 235: Lowest Common Ancestor of a Binary Search Tree
pre target class defined als tor span lee define Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given no
論文筆記-Joint Deep Modeling of Users and Items Using Reviews for Recommendation
一個 solved default view http ati onf 評分 分享 基本思路:利用用戶和商品的評論構建CNN預測評分。 網絡結構: user review網絡與 item review網絡結構一致,僅就前者進行說明 從user review tex
【Leetcode】235. Lowest Common Ancestor of a Binary Search Tree
tween target amp des esc blog cor 循環 ive Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in
【easy】235. Lowest Common Ancestor of a Binary Search Tree
color turn int spa bsp style for public search 題意大概是,找兩個節點的最低公共祖先 /** * Definition for a binary tree node. * struct TreeNode { *
LC.235.Lowest Common Ancestor of a Binary Search Tree
否則 where 最小 script sel init 等於 返回 sin https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/Given a bi
235. Lowest Common Ancestor of a Binary Search Tree
reat system oot main println binary pri HR 實現 原題鏈接:https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/descripti
LeetCode 236. Lowest Common Ancestor of a Binary Tree; 235. Lowest Common Ancestor of a Binary Search Tree
lowest node nan stc leet common lca ear 尋找 236. Lowest Common Ancestor of a Binary Tree 遞歸尋找p或q,如果找到,層層向上返回,知道 root 左邊和右邊都不為NULL:if (lef